Computational Equivalence and Classical Recursion Theory

DOI10.1007/978-3-642-35482-3_20zbMath1298.68186OpenAlexW33411112MaRDI QIDQ2929349

Klaus Sutner

Publication date: 12 November 2014

Published in: Emergence, Complexity and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35482-3_20

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Recursive functions and relations, subrecursive hierarchies (03D20)

This page was built for publication: Computational Equivalence and Classical Recursion Theory