Computer Science – Computational Complexity
Scientific paper
2012-03-15
Informatica, 2010, 21(3), 425-454
Computer Science
Computational Complexity
31 pages, 1 figure
Scientific paper
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the relativity of mathematical languages used to describe the Turing machines. A deep investigation is performed on the interrelations between mechanical computations and their mathematical descriptions emerging when a human (the researcher) starts to describe a Turing machine (the object of the study) by different mathematical languages (the instruments of investigation). Together with traditional mathematical languages using such concepts as 'enumerable sets' and 'continuum' a new computational methodology allowing one to measure the number of elements of different infinite sets is used in this paper. It is shown how mathematical languages used to describe the machines limit our possibilities to observe them. In particular, notions of observable deterministic and non-deterministic Turing machines are introduced and conditions ensuring that the latter can be simulated by the former are established.
Garro Alfredo
Sergeyev Yaroslav D.
No associations
LandOfFree
Observability of Turing Machines: a Refinement of the Theory of Computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Observability of Turing Machines: a Refinement of the Theory of Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Observability of Turing Machines: a Refinement of the Theory of Computation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-30481