Results 41 to 50 of about 2,960,567 (255)

The Turing Machine on the Dissecting Table

open access: yesTeorie vědy, 2013
THE TURING MACHINE ON THE DISSECTING TABLE Abstract: Since the beginning of the twenty-first century there has been an increasing awareness that software rep- resents a blind spot in new media theory.
Jana Horáková
doaj   +1 more source

A quantum-information-theoretic complement to a general-relativistic implementation of a beyond-Turing computer [PDF]

open access: yes, 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

An Analogue-Digital Model of Computation: Turing Machines with Physical Oracles [PDF]

open access: yes, 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

On the Proper Treatment of Dynamics in Cognitive Science

open access: yesTopics in Cognitive Science, EarlyView., 2023
Abstract This essay examines the relevance of dynamical ideas for cognitive science. On its own, the mere mathematical idea of a dynamical system is too weak to serve as a scientific theory of anything, and dynamical approaches within cognitive science are too rich and varied to be subsumed under a single “dynamical hypothesis.” Instead, after first ...
Randall D. Beer
wiley   +1 more source

Turing Machine Approach To Runtime Software Adaptation

open access: yesComputer Science, 2014
In this paper, the problem of applying changes to software at runtime is considered. The computability theory is used in order to develop a more general and programming-language-independent model of computation with support for runtime changes.
Jarosław Rudy
doaj   +1 more source

Quasi-Delay-Insensitive Circuits are Turing-Complete [PDF]

open access: yes, 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

Local Search and the Evolution of World Models

open access: yesTopics in Cognitive Science, EarlyView., 2023
Abstract An open question regarding how people develop their models of the world is how new candidates are generated for consideration out of infinitely many possibilities. We discuss the role that evolutionary mechanisms play in this process. Specifically, we argue that when it comes to developing a global world model, innovation is necessarily ...
Neil R. Bramley   +3 more
wiley   +1 more source

Generating Turing Machines by Use of Other Computation Models [PDF]

open access: yesComputer 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  

Computer als Modelle des Geistes

open access: yesÖ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

On Halting Process of Quantum Turing Machine

open access: yes, 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

Home - About - Disclaimer - Privacy