Cellular automata using infinite computations

From MaRDI portal
Publication:440667

DOI10.1016/j.amc.2011.10.065zbMath1252.37017arXiv1110.6143OpenAlexW2963595960MaRDI QIDQ440667

Louis D'Alotto

Publication date: 19 August 2012

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

Full work available at URL: https://arxiv.org/abs/1110.6143




Related Items (25)

A classification of one-dimensional cellular automata using infinite computationsA cellular model of prisoners dilemma for ``prodding gratuitySome paradoxes of infinity revisitedA 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 algorithmNumerical infinitesimals in a variable metric method for convex nonsmooth optimizationThe Sierpinski curve viewed by numerical computations with infinities and infinitesimalsThe Olympic medals ranks, lexicographic ordering, and numerical infinitiesLower and upper estimates of the quantity of algebraic numbersThe exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite areaFibonacci words, hyperbolic tilings and grossoneOn strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scalesA new approach to the \(Z\)-transform through infinite computationThe exact measures of the Sierpiński \(d\)-dimensional tetrahedron in connection with a Diophantine nonlinear systemSolving ordinary differential equations on the Infinity Computer by working with infinitesimals numericallyNoise-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 arithmeticConjugate-symplecticity properties of Euler-Maclaurin methods and their implementation on the infinity computerA Simulink-based software solution using the infinity computer methodology for higher order differentiationPlanar methods and grossone for the conjugate gradient breakdown in nonlinear programmingIndependence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite



Cites Work




This page was built for publication: Cellular automata using infinite computations