Cellular automata and grossone computations
From MaRDI portal
Recommendations
- A classification of one-dimensional cellular automata using infinite computations
- Computations with grossone-based infinities
- A classification of two-dimensional cellular automata using infinite computations
- A simple way to treat infinite and infinitesimal numbers
- Methodology of Numerical Computations with Infinities and Infinitesimals
Cited in
(14)- Computation theory of cellular automata
- Cellular automata, matrix substitutions and fractals
- Computing shifts in 90/150 cellular automata sequences
- Generalized Gandy-Păun-Rozenberg Machines for Tile Systems and Cellular Automata
- A classification of one-dimensional cellular automata using infinite computations
- scientific article; zbMATH DE number 5799714 (Why is no real title available?)
- Cellular Automata, the Collatz Conjecture and Powers of 3/2
- On the computational power of totalistic cellular automata
- scientific article; zbMATH DE number 98514 (Why is no real title available?)
- Cellular automata using infinite computations
- The grossone methodology perspective on Turing machines
- A classification of two-dimensional cellular automata using infinite computations
- scientific article; zbMATH DE number 5582873 (Why is no real title available?)
- Constructible functions in cellular automata and their applications to hierarchy results
This page was built for publication: Cellular automata and grossone computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2973074)