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

Authors:
Yaroslav D. Sergeyev;Alfredo Garro
Affiliations:
Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, Rende (CS), Italy and N.I. Lobatchevsky State University, Nizhni Novgorod, Russia and Istituto di Calcolo e ...;Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, Rende (CS), Italy
Venue:
The Journal of Supercomputing
Year:
2013

Citing 6
Cited 0

Quantum computation and quantum information

Quantum computation and quantum information
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Reaction-Diffusion Computers

Reaction-Diffusion Computers
A New Applied Approach for Executing Computations with Infinite and Infinitesimal Quantities

Informatica
Interval Arithmetic Based Optimization in Nonlinear Regression

Informatica
Observability of Turing Machines: A Refinement of the Theory of Computation

Informatica

Quantified Score

Hi-index	0.00

Visualization

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.