Cellular Automata Using Infinite Computations

Details Cellular Automata Using Infinite Computations Cellular Automata Using Infinite Computations

2011-10-27

arxiv.org/abs/1110.6143v1

Computer Science

Discrete Mathematics

Paper Accepted for Publication in Applied Mathematics and Computation, Elsevier

Scientific paper

This paper presents an application of the Infinite Unit Axiom, introduced by Yaroslav Sergeyev, (see [11] - [14]) to the development of one-dimensional cellular automata. This application allows the establishment of a new and more precise metric on the space of definition for one-dimensional cellular automata, whereby accuracy of computations is increased. Using this new metric, open disks are defined and the number of points in each disk is computed. The forward dynamics of a cellular automaton map are also studied via defined equivalence classes. Using the Infinite Unit Axiom, the number of configurations that stay close to a given configuration under the shift automaton map can now be computed.

Affiliated with

Also associated with

No associations

Rating

Cellular Automata Using Infinite Computations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cellular Automata Using Infinite Computations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cellular Automata Using Infinite Computations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-376508