A classification of one-dimensional cellular automata using infinite computations

From MaRDI portal
Publication:299409

DOI10.1016/j.amc.2014.06.087zbMath1338.68177OpenAlexW2155257994MaRDI QIDQ299409

Louis D'Alotto

Publication date: 22 June 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.06.087




Related Items (19)

Infinite games on finite graphs using grossoneOn the use of the infinity computer architecture to set up a dynamic precision floating-point arithmeticA constructive sequence algebra for the calculus of indicationsComputations with Grossone-Based InfinitiesObservability in the univalent universeInfinite numerical computing applied to Hilbert's, Peano's, and Moore's curvesNonlinear programming and grossone: quadratic programing and the role of constraint qualificationsLexicographic multi-objective linear programming using grossone methodology: theory and algorithmThe Sierpinski curve viewed by numerical computations with infinities and infinitesimalsPower Consumption in Cellular AutomataThe exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite areaComputation of higher order Lie derivatives on the infinity computerA new approach to the \(Z\)-transform through infinite computationThe exact measures of the Sierpiński \(d\)-dimensional tetrahedron in connection with a Diophantine nonlinear systemInfinite Games on Finite Graphs Using GrossoneNoise-induced kinetic transition in two-component environmentA generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmeticNon-Archimedean game theory: a numerical approachPlanar methods and grossone for the conjugate gradient breakdown in nonlinear programming



Cites Work


This page was built for publication: A classification of one-dimensional cellular automata using infinite computations