A comparison of the work done by generalized sequential machines and Turing machines
نویسندگان
چکیده
منابع مشابه
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...
متن کاملSome relations between quantum Turing machines and Turing machines
For quantum Turing machines we present three elements: Its components, its time evolution operator and its local transition function. The components are related with the components of deterministic Turing machines, the time evolution operator is related with the evolution of reversible Turing machines and the local transition function is related with the transition function of probabilistic and...
متن کاملNumbers Deened by Turing Machines
We consider three types of Turing machines deening functions on in-nite words and investigate some characteristic properties of these types of Turing machine mappings. Using the interpretation of innnite words as the expansions of numbers we obtain three classes of real respectively complex numbers. We prove that the three classes of complex numbers form algebraically closed subbelds of the eld...
متن کاملSimulations of Quantum Turing Machines by Quantum Multi-Stack Machines
As was well known, in classical computation, Turing machines, circuits, multi-stack machines, and multi-counter machines are equivalent, that is, they can simulate each other in polynomial time. In quantum computation, Yao [11] first proved that for any quantum Turing machines M , there exists quantum Boolean circuit (n, t)-simulating M , where n denotes the length of input strings, and t is th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1962
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1962-0138546-7