A classification of two-dimensional cellular automata using infinite computations
From MaRDI portal
Recommendations
- Cellular automata using infinite computations
- A classification of one-dimensional cellular automata using infinite computations
- Cellular automata and grossone computations
- A new applied approach for executing computations with infinite and infinitesimal quantities
- Metamathematical investigations on the theory of grossone
Cited in
(20)- Conjugate-symplecticity properties of Euler-Maclaurin methods and their implementation on the infinity computer
- A constructive sequence algebra for the calculus of indications
- The use of grossone in elastic net regularization and sparse support vector machines
- Iterative grossone-based computation of negative curvature directions in large-scale optimization
- The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area
- Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology
- Noise-induced kinetic transition in two-component environment
- A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic
- Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite
- Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications
- Observability in the univalent universe
- Computations with grossone-based infinities
- scientific article; zbMATH DE number 6691910 (Why is no real title available?)
- Cellular automata and grossone computations
- A classification of one-dimensional cellular automata using infinite computations
- Cellular automata using infinite computations
- scientific article; zbMATH DE number 1462667 (Why is no real title available?)
- scientific article; zbMATH DE number 1839463 (Why is no real title available?)
- Bulking II: Classifications of cellular automata
- Characterization of two-dimensional cellular automata over ternary fields
This page was built for publication: A classification of two-dimensional cellular automata using infinite computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5258132)
