Journal of Supercomputing 65 (2):645-663 (2013)
AbstractThe paper investigates how the mathematical languages used to describe and to observe automatic computations influence the accuracy of the obtained results. In particular, we focus our attention on Single and Multi-tape Turing machines which are described and observed through the lens of a new mathematical language which is strongly based on three methodological ideas borrowed from Physics and applied to Mathematics, namely: the distinction between the object (we speak here about a mathematical object) of an observation and the instrument used for this observation; interrelations holding between the object and the tool used for the observation; the accuracy of the observation determined by the tool. Results of the observation executed by the traditional and new languages are compared and discussed.
Similar books and articles
Observability of Turing Machines: a refinement of the theory of computation.Yaroslav Sergeyev & Alfredo Garro - 2010 - Informatica 21 (3):425–454.
Infinite Time Turing Machines With Only One Tape.D. E. Seabold & J. D. Hamkins - 2001 - Mathematical Logic Quarterly 47 (2):271-287.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Computable Diagonalizations and Turing’s Cardinality Paradox.Dale Jacquette - 2014 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 45 (2):239-262.
Lagrange Lecture: Methodology of numerical computations with infinities and infinitesimals.Yaroslav Sergeyev - 2010 - Rendiconti Del Seminario Matematico dell'Università E Del Politecnico di Torino 68 (2):95–113.
Turing’s man: a dialogue. [REVIEW]Helena Granström & Bo Göranzon - 2013 - AI and Society 28 (1):21-25.
Non-Turing Computers and Non-Turing Computability.Mark Hogarth - 1994 - Psa 1994:126--138.
Eventually infinite time Turing machine degrees: Infinite time decidable reals.P. D. Welch - 2000 - Journal of Symbolic Logic 65 (3):1193-1203.
Added to PP
Historical graph of downloads
Citations of this work
Independence of the Grossone-Based Infinity Methodology from Non-standard Analysis and Comments upon Logical Fallacies in Some Texts Asserting the Opposite.Yaroslav D. Sergeyev - 2019 - Foundations of Science 24 (1):153-170.
References found in this work
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Exact and Approximate Arithmetic in an Amazonian Indigene Group.Pierre Pica, Cathy Lemer, Véronique Izard & Stanislas Dehaene - 2004 - Science 306 (5695):499-503.
An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.