Multi-Resolution Cellular Automata for Real Computation

DOI10.1007/978-3-642-21875-0_19zbMath1344.68155OpenAlexW1808387256MaRDI QIDQ3091455

Brian Patterson, James I. Lathrop, Jack H. Lutz

Publication date: 9 September 2011

Published in: Models of Computation in Context (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21875-0_19

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Computation over the reals, computable analysis (03D78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Three concepts of decidability for general subsets of uncountable spaces
• Computational complexity of real functions
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Undecidability in Rⁿ: Riddled Basins, the KAM Tori, and the Stability of the Solar System
• Computable functionals
• Infinite time Turing machines
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
• Systems of Logic Based on Ordinals^†

This page was built for publication: Multi-Resolution Cellular Automata for Real Computation