Results 51 to 60 of about 2,596,832 (272)
Local Search and the Evolution of World Models
Topics 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
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
Formalizing Turing Machines [PDF]
, 2012 We discuss the formalization, in the Matita Theorem Prover, of a few, basic results on Turing Machines, up to the existence of a (certified) Universal Machine. The work is meant to be a preliminary step towards the creation of a formal repository in Complexity Theory, and is a small piece in our Reverse Complexity program, aiming to a comfortable ...
ASPERTI, ANDREA, RICCIOTTI, WILMER
openaire +2 more sources
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
On Turing Machines Deciding According to the Shortest Computations
Axioms, 2021 In this paper we propose and analyse from the computational complexity point of view several new variants of nondeterministic Turing machines. In the first such variant, a machine accepts a given input word if and only if one of its shortest possible ...
Florin Manea
doaj +1 more source
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
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
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
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