Results 1 to 10 of about 119,023 (103)
An Intensional Concurrent Faithful Encoding of Turing Machines [PDF]
, 2014 The benchmark for computation is typically given as Turing computability; the ability for a computation to be performed by a Turing Machine. Many languages exploit (indirect) encodings of Turing Machines to demonstrate their ability to support arbitrary ...
Given-Wilson, Thomas
core +5 more sources
Verifying Time Complexity of Deterministic Turing Machines [PDF]
, 2014 We show that, for all reasonable functions $T(n)=o(n\log n)$, we can algorithmically verify whether a given one-tape Turing machine runs in time at most $T(n)$. This is a tight bound on the order of growth for the function $T$ because we prove that, for $
Gajser, David
core +1 more source
Local Transition Functions of Quantum Turing Machines [PDF]
, 2000 Foundations of the notion of quantum Turing machines are investigated. According to Deutsch's formulation, the time evolution of a quantum Turing machine is to be determined by the local transition function.
Nishimura, Harumichi, Ozawa, Masanao
core +2 more sources
Universality and programmability of quantum computers [PDF]
, 2007 Manin, Feynman, and Deutsch have viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum logic circuits and quantum Turing machines has shown how these machines can simulate an arbitrary unitary ...
Fouche', Willem +3 more
core +2 more sources
On Halting Process of Quantum Turing Machine
, 2003 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.
Deutsch D. +3 more
core +1 more source
An Analogue-Digital Model of Computation: Turing Machines with Physical Oracles [PDF]
, 2016 We introduce an abstract analogue-digital model of computation that couples Turing machines to oracles that are physical processes. Since any oracle has the potential to boost the computational power of a Turing machine, the effect on the power of the ...
CG Hempel +4 more
core +1 more source
A quantum-information-theoretic complement to a general-relativistic implementation of a beyond-Turing computer [PDF]
, 2014 There exists a growing literature on the so-called physical Church-Turing thesis in a relativistic spacetime setting. The physical Church-Turing thesis is the conjecture that no computing device that is physically realizable (even in principle) can ...
Wuthrich, Christian
core +2 more sources
Computability and human symbolic output [PDF]
, 2013 This paper concerns “human symbolic output,” or strings of characters produced by humans in our various symbolic systems; e.g., sentences in a natural language, mathematical propositions, and so on.
Megill, Jason, Melvin, Tim
core +4 more sources
, 2016 A novel computing model, called \emph{Probe Machine}, is proposed in this paper. Different from Turing Machine, Probe Machine is a fully-parallel computing model in the sense that it can simultaneously process multiple pairs of data, rather than ...
Xu, Jin
core +2 more sources
A Concrete View of Rule 110 Computation
, 2009 Rule 110 is a cellular automaton that performs repeated simultaneous updates of an infinite row of binary values. The values are updated in the following way: 0s are changed to 1s at all positions where the value to the right is a 1, while 1s are changed
Anthony K. Seda +4 more
core +2 more sources