activity
20012023
most citedNon maximal cyclically monotone graphs and construction of a bipotential for the Coulomb's dry friction law

22 citations · 216 across the 59 of their papers we have counts for

collaborators

61 papers

math-ph2023

Dissipation and the information content of the deviation from hamiltonian dynamics

Marius Buliga

We explain a dissipative version of hamiltonian mechanics, based on the information content of the deviation from hamiltonian dynamics. From this formulation we deduce minimal diss…

cs.AI2023

chemSKI with tokens: world building and economy in the SKI universe

Marius Buliga

chemSKI with tokens is a confluent graph rewrite system where all rewrites are local, which moreover can be used to do SKI calculus reductions. The graph rewrites of chemSKI are ma…

math.GR2021

COLIN implies LIN for emergent algebras

Marius Buliga

Emergent algebras, first time introduced in arXiv:0907.1520 , are families of quasigroup operations indexed by a commutative group, which satisfy some algebraic relations and also…

cs.LO2020★ 1 cited

Graph rewrites, from graphic lambda calculus, to chemlambda, to directed interaction combinators

Marius Buliga

Here I report about the modifications of and relations between graphic lambda calculus, various formalisms which appeared under the name chemlambda and a version of directed intera…

cs.AI2020★ 1 cited

Artificial life properties of directed interaction combinators vs. chemlambda

M. Buliga

We provide a framework for experimentation at https://mbuliga.github.io/quinegraphs/ic-vs-chem.html#icvschem with two artificial chemistries: directed interaction combinators (dirI…

cs.AI2020★ 3 cited

Artificial chemistry experiments with chemlambda, lambda calculus, interaction combinators

Marius Buliga

Given a graph rewrite system, a graph G is a quine graph if it has a non-void maximal collection of non-conflicting matches of left patterns of graphs rewrites, such that after the…