Multi-resolution cellular automata for real computation
JI Lathrop, JH Lutz, B Patterson - Conference on Computability in Europe, 2011 - Springer
JI Lathrop, JH Lutz, B Patterson
Conference on Computability in Europe, 2011•SpringerThis paper introduces multi-resolution cellular automata (MRCA), a multi-resolution variant
of cellular automata. Cells in an MRCA are allowed to “fission” one or more times during the
course of execution. At any given time, the MRCA may thus be carrying out computations on
a variety of spatial scales. Our main theorem uses the MRCA model to give a natural
characterization of the computability of sets in Euclidean space, provided that their
boundaries are computably nowhere dense.
of cellular automata. Cells in an MRCA are allowed to “fission” one or more times during the
course of execution. At any given time, the MRCA may thus be carrying out computations on
a variety of spatial scales. Our main theorem uses the MRCA model to give a natural
characterization of the computability of sets in Euclidean space, provided that their
boundaries are computably nowhere dense.
Abstract
This paper introduces multi-resolution cellular automata (MRCA), a multi-resolution variant of cellular automata. Cells in an MRCA are allowed to “fission” one or more times during the course of execution. At any given time, the MRCA may thus be carrying out computations on a variety of spatial scales. Our main theorem uses the MRCA model to give a natural characterization of the computability of sets in Euclidean space, provided that their boundaries are computably nowhere dense.
Springer
Showing the best result for this search. See all results