Observability of Turing machines: a refinement of the theory of computation

zbMATH Open1209.68255arXiv1203.3298MaRDI QIDQ3064583FDOQ3064583

Authors: Alfredo Garro, Yaroslav D. Sergeyev 

Publication date: 22 December 2010

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

Recommendations

• The grossone methodology perspective on Turing machines
• scientific article; zbMATH DE number 2150282
• Turing machine and its symbolic simulation
• Turing machines. Introduction to the characterization of the complexity of a problem
• Publication:4508548

zbMATH Keywords

infinite setsrelativity of mathematical languagesobservability of Turing machinesSapir-Whorf thesistheory of automatic computations

Mathematics Subject Classification ID

Cited In (34)

• Conjugate-symplecticity properties of Euler-Maclaurin methods and their implementation on the infinity computer
• On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales
• Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite
• The Sierpinski curve viewed by numerical computations with infinities and infinitesimals
• Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm
• A new approach to the \(Z\)-transform through infinite computation
• Infinite Games on Finite Graphs Using Grossone
• A classification of one-dimensional cellular automata using infinite computations
• Infinite computations and the generic finite
• Metamathematical investigations on the theory of grossone
• The exact measures of the Sierpiński \(d\)-dimensional tetrahedron in connection with a Diophantine nonlinear system
• An application of grossone to the study of a family of tilings of the hyperbolic plane
• Solving ordinary differential equations on the Infinity Computer by working with infinitesimals numerically
• Some paradoxes of infinity revisited
• A constructive sequence algebra for the calculus of indications
• Infinite numerical computing applied to Hilbert's, Peano's, and Moore's curves
• Computational processes, observers and Turing incompleteness
• On the topological convergence of multi-rule sequences of sets and fractal patterns
• Non-Archimedean game theory: a numerical approach
• Self-monitoring machines and an \(\omega^ \omega\) hierarchy of loops
• The Olympic medals ranks, lexicographic ordering, and numerical infinities
• Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming
• Computations with grossone-based infinities
• The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area
• On accuracy of mathematical languages used to deal with the Riemann zeta function and the Dirichlet eta function
• Using grossone to count the number of elements of infinite sets and the connection with bijections
• A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic
• Infinite games on finite graphs using grossone
• Taking the Pirahã seriously
• Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications
• The grossone methodology perspective on Turing machines
• A new computational methodology using infinite and infinitesimal numbers
• A Simulink-Based Infinity Computer Simulator and Some Applications
• Observability in the univalent universe

This page was built for publication: Observability of Turing machines: a refinement of the theory of computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3064583)