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