Results 41 to 50 of about 2,873,182 (250)
Mathematics in the age of the Turing machine [PDF]
Turing's Legacy, 2013 The article gives a survey of mathematical proofs that rely on computer calculations and formal proofs.
T. Hales
semanticscholar +1 more source
Undecidability and Complexity for Super-Turing Models of Computation
Proceedings, 2022 It seems that intelligent complex systems will require formalisms having richer behavior than Turing machines. Very little is known about the relations (e.g., the expressiveness and/or effectiveness) between new super-Turing models of computation.
Eugene Eberbach
doaj +1 more source
Thermodynamics of stochastic Turing machines [PDF]
Physical Review E, 2015 13 pages incl.
Strasberg, Philipp +3 more
openaire +5 more sources
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
Addressing Machines as models of lambda-calculus [PDF]
Logical Methods in Computer Science, 2022 Turing machines and register machines have been used for decades in theoretical computer science as abstract models of computation. Also the $\lambda$-calculus has played a central role in this domain as it allows to focus on the notion of functional ...
Giuseppe Della Penna +2 more
doaj +1 more source
Weight-reducing Turing machines
Information and Computation, 2023 It is well-known that one-tape Turing machines working in linear time are no more powerful than finite automata, namely they recognize exactly the class of regular languages. We prove that it is not decidable if a one-tape machine works in linear time, even if it is deterministic and restricted to use only the portion of the tape which initially ...
Guillon, Bruno +3 more
openaire +2 more sources
Going beyond Church–Turing Thesis Boundaries: Digital Genes, Digital Neurons and the Future of AI
Proceedings, 2020 The Church–Turing thesis deals with computing functions that are described by a list of formal, mathematical rules or sequences of event-driven actions such as modeling, simulation, business workflows, etc.
Rao Mikkilineni
doaj +1 more source
A Turing Machine Resisting Isolated Bursts Of Faults [PDF]
Chicago journal of theoretical computer science, 2012 We consider computations of a Turing machine under noise that causes consecutive violations of the machine's transition function. Given a constant upper bound β on the size of bursts of faults, we construct a Turing machine M (β ) subject to faults that ...
Ilir Çapuni, P. Gács
semanticscholar +1 more source
Turing machines and bimachines
Theoretical Computer Science, 2008 AbstractWe associate the iterated block product of a bimachine with a deterministic Turing machine. This allows us to introduce new algebraic notions to study the behavior of the Turing machine. Namely, we introduce double semidirect products through matrix multiplication of upper triangular matrices with coefficients in certain semigroups, which leads
Pedro V. Silva, John Rhodes
openaire +2 more sources
Python Type Hints are Turing Complete [PDF]
arXiv, 2022 Grigore showed that Java generics are Turing complete by describing a reduction from Turing machines to Java subtyping. We apply Grigore's algorithm to Python type hints and deduce that they are Turing complete. In addition, we present an alternative reduction in which the Turing machines are simulated in real time, resulting in significantly lower ...
arxiv