Tangled Tapes: Infinity, Interaction and Turing Machines
نویسندگان
چکیده
In the sixty-five years since Turing introduced his eponymous machines, many popular misconceptions about their properties have become current. In this paper, we explore the notions that Turing machines have infinite tapes and that their expressive power is limited by by an inability to interact with the wider environment during computations.
منابع مشابه
A Comparison of the Work Done by Generalized Sequential Machines and Turing Machines
For a long time it has been accepted that Turing machines are more powerful than generalized sequential machines. Since a generalized sequential machine is also a Turing machine, the class of Turing machines is at least as powerful as the class of generalized sequential machines. The purpose of this paper is to examine the adverb "more" from the aspect of work accomplished. Three manifestations...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملTuring Machines , P , NP and NP - completeness
I assume that most students have encountered Turing machines before. (Students who have not may want to look at Sipser’s book [3].) A Turing machine is defined by an integer k ≥ 1, a finite set of states Q, an alphabet Γ, and a transition function δ : Q×Γk → Q×Γk−1×{L, S,R}k where: • k is the number of (infinite, one-dimensional) tapes used by the machine. In the general case we have k ≥ 3 and ...
متن کاملTuring Machines on Graphs and Inescapable Groups
We present a generalization of standard Turing machines based on allowing unusual tapes. We present a set of reasonable constraints on tape geometry and classify all tapes conforming to these constraints. Surprisingly, this generalization does not lead to yet another equivalent formulation of the notion of computable function. Rather, it gives an alternative definition of the recursively enumer...
متن کاملConstant Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines
‘Leaf-size’ (or ‘branching’) is the minimum number of leaves of some accepting computation trees of alternating devices. For example, one leaf corresponds to nondeterministic computation. In this paper, we investigate the effect of constant leaves of three-dimensional alternating Turing machines, and show the following facts : (1) For cubic input tapes, k leafand L(m) space-bounded three-dimens...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012