Results 31 to 40 of about 134,383 (239)
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
Computer als Modelle des Geistes
Österreichische Zeitschrift für Geschichtswissenschaften, 2008 The article considers the complexities of thinking about the computer as a model of the mind. It examines the computer as being a model of the brain in several very different senses of ‚model‘.
Peter Asaro
doaj +1 more source
Quasi-Delay-Insensitive Circuits are Turing-Complete [PDF]
, 1995 Quasi-delay-insensitive (QDI) circuits are those whose correct operation does not depend on the delays of operators or wires, except for certain wires that form isochronic forks.
Manohar, Rajit, Martin, Alain J.
core +5 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
Generating Turing Machines by Use of Other Computation Models [PDF]
Computer Science, 2003 For each problem that can be solved there exists algorithm, which can be described with a program of Turing machine. Because this is very simple model programs tend to be very complicated and hard to analyse by human.
Leszek Dubiel
doaj
Ray tracing — computing the incomputable? [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We recall from previous work a model-independent framework of computational complexity theory. Notably for the present paper, the framework allows formalization of the issues of precision that present themselves when one considers physical, error-prone ...
Ed Blakey
doaj +1 more source
Solving the word problem in real time [PDF]
, 2001 The paper is devoted to the study of groups whose word problem can be solved by a Turing machine which operates in real time. A recent result of the first author for word hyperbolic groups is extended to prove that under certain conditions the ...
Holt, Derek F., Rees, Sarah
core +1 more source
Refining Mark Burgin’s Case against the Church–Turing Thesis
PhilosophiesThe outputs of a Turing machine are not revealed for inputs on which the machine fails to halt. Why is an observer not allowed to see the generated output symbols as the machine operates?
Edgar Graham Daylight
doaj +1 more source
Information and Control, 1977 A structured decomposition theorem for Turing machines is given. The nature of the building blocks and the form of the connections allowed suggest a parallel to the Bohm-Jacopini theorem on structured flowcharts. Thus in a broadest sense, there is obtained an independent machine-theoretic restatement of the fundamental precepts of structured ...
openaire +2 more sources
The Irrelevance of the Turing Test in Current Deep Learning
Profil, 2021 The role of artificial intelligence in the Turing test is to imitate human beings to such an extent that people will not realize it is a machine. With the rise of deep learning (a subcategory of AI), the situation is changing rapidly as the new systems ...
Ondrej Hriadel
doaj +1 more source