Single-tape and multi-tape Turing machines through the lens of the Grossone methodology

Journal of Supercomputing 65 (2):645-663 (2013)
  Copy   BIBTEX

Abstract

The 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.

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Infinite Time Turing Machines With Only One Tape.D. E. Seabold & J. D. Hamkins - 2001 - Mathematical Logic Quarterly 47 (2):271-287.
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.
Generalized periodicity and primitivity for words.Masami Ito & Gerhard Lischke - 2007 - Mathematical Logic Quarterly 53 (1):91-106.
Counting systems and the First Hilbert problem.Yaroslav Sergeyev - 2010 - Nonlinear Analysis Series A 72 (3-4):1701-1708.
The computational strengths of α-tape infinite time Turing machines.Benjamin Rin - 2014 - Annals of Pure and Applied Logic 165 (9):1501-1511.

Analytics

Added to PP
2013-12-09

Downloads
5,020 (#1,470)

6 months
310 (#6,909)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Yaroslav Sergeyev
Università della Calabria

References found in this work

Non-standard Analysis.Gert Heinz Müller - 2016 - Princeton University Press.
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.
On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.

View all 26 references / Add more references