arXiv subjects

Evgenia Falkovich

Publications and source records attributed to Evgenia Falkovich.

2 recordsLinked to original sources

arXiv2015

Cellular Automata are Generic

Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular automaton with unconstrained topology and with the power to create new cells. The advantage is that the latter is closer to physical reality. The overhead of our simulation is quadratic.

cs.LO↗

arXiv2012

A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-

We prove the Extended Church-Turing Thesis: Every effective algorithm can be efficiently simulated by a Turing machine. This is accomplished by emulating an effective algorithm via an abstract state machine, and simulating such an abstract state machine by a random access machine, representing data as a minimal term graph.

cs.LO↗