Results 1 to 10 of about 2,596,832 (272)
Turing Automata and Graph Machines [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras.
Elham Kashefi +3 more
core +6 more sources
A theory of consciousness from a theoretical computer science perspective: Insights from the Conscious Turing Machine [PDF]
Proc Natl Acad Sci U S A, 2021 Significance This paper provides evidence that a theoretical computer science (TCS) perspective can add to our understanding of consciousness by providing a simple framework for employing tools from computational complexity theory and machine learning ...
L. Blum, M. Blum
semanticscholar +2 more sources
Journal of Humanistic Mathematics, 2021 The musings of a Turing Machine.
M. Curtis
semanticscholar +3 more sources
On Halting Process of Quantum Turing Machine [PDF]
, 2005 We prove that there is no algorithm to tell whether an arbitrarily constructed Quantum Turing Machine has same time steps for different branches of computation. We, hence, can not avoid the notion of halting to be probabilistic in Quantum Turing Machine.
Takayuki Miyadera, Masanori Ohya
openalex +3 more sources
Decision Problems For Turing Machines [PDF]
Information Processing Letters, 2009 We answer two questions posed by Castro and Cucker, giving the exact complexities of two decision problems about cardinalities of omega-languages of Turing machines.
Dominique Lecomte +2 more
core +8 more sources
On-line turing machine recognition
Information and Control, 1968 Let U(n) be a monotone increasing function which is real-time computable, {if442-1}. Then it is possible to describe a set of words AU such that(1)AU is recognizable within the time bound T(n) = C1.U(n), for suitable {itC1};(2)If M is an on-line Turing machine which recognizes the set of words AU, then τM(n) > CM.U}(n) for infinitely many values of n ...
Pavel Strnad
openalex +3 more sources
Models of Quantum Turing Machines [PDF]
Fortschritte der Physik, 1999 Quantum Turing machines are discussed and reviewed in this paper. Most of the paper is concerned with processes defined by a step operator $T$ that is used to construct a Hamiltonian $H$ according to Feynman's prescription. Differences between these models and the models of Deutsch are discussed and reviewed.
Paul Benioff
openalex +6 more sources
Infinite time Turing machines [PDF]
Journal of Symbolic Logic, 2000 AbstractWe extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. Everyset. for example, is decidable by such machines, and the semi-decidable sets form a portion of thesets.
Joel David Hamkins, Andy Lewis
openalex +3 more sources
Simulating Turing machines on Maurer machines
Journal of Applied Logic, 2007 AbstractIn a previous paper, we used Maurer machines to model and analyse micro-architectures. In the current paper, we investigate the connections between Turing machines and Maurer machines with the purpose to gain an insight into computability issues relating to Maurer machines. We introduce ways to simulate Turing machines on a Maurer machine which,
J.A. Bergstra, C.A. Middelburg
openalex +5 more sources
Reactive Turing machines [PDF]
Information and Computation, 2011 We propose reactive Turing machines (RTMs), extending classical Turing machines with a process-theoretical notion of interaction, and use it to define a notion of executable transition system. We show that every computable transition system with a bounded branching degree is simulated modulo divergence-preserving branching bisimilarity by an RTM, and ...
Baeten, J.C.M. +2 more
openaire +11 more sources