Multi-resolution cellular automata for real computation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3788601 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1869997 (Why is no real title available?)
- scientific article; zbMATH DE number 2188483 (Why is no real title available?)
- scientific article; zbMATH DE number 3363435 (Why is no real title available?)
- Cellular automata. A discrete view of the world.
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Computable functionals
- Computational complexity of real functions
- Computing over the reals: foundations for scientific computing.
- 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†
- Three concepts of decidability for general subsets of uncountable spaces
- Undecidability in Rn: Riddled Basins, the KAM Tori, and the Stability of the Solar System
This page was built for publication: Multi-resolution cellular automata for real computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3091455)