scientific article; zbMATH DE number 7438582
From MaRDI portal
Publication:5013888
zbMath1476.68161arXiv1504.03013MaRDI QIDQ5013888
Evgenia Falkovich, Nachum Dershowitz
Publication date: 3 December 2021
Full work available at URL: https://arxiv.org/abs/1504.03013
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cellular automata (computational aspects) (68Q80) Classical models of computation (Turing machines, etc.) (68Q04)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Choiceless polynomial time
- On Gurevich's theorem on sequential algorithms
- The physical Church thesis as an explanation of the Galileo thesis
- Causal Graph Dynamics
- Exact Exploration and Hanging Algorithms
- A Natural Axiomatization of Computability and Proof of Church's Thesis
- On polynomial time computation over unordered structures
- Evolving Algebras 1993: Lipari Guide
- The Church-Turing Thesis over Arbitrary Domains
- Trial and error predicates and the solution to a problem of Mostowski
- Limiting recursion
- Sequential abstract-state machines capture sequential algorithms
