Results 1 
5 of
5
Computational universes
 Chaos, Solitons & Fractals
, 2006
"... Suspicions that the world might be some sort of a machine or algorithm existing “in the mind ” of some symbolic number cruncher have lingered from antiquity. Although popular at times, the most radical forms of this idea never reached mainstream. Modern developments in physics and computer science h ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
Suspicions that the world might be some sort of a machine or algorithm existing “in the mind ” of some symbolic number cruncher have lingered from antiquity. Although popular at times, the most radical forms of this idea never reached mainstream. Modern developments in physics and computer science have lent support to the thesis, but empirical evidence is needed before it can begin to replace our contemporary world view.
On the calculating power of Laplace’s demon (Part I)
, 2006
"... We discuss several ways of making precise the informal concept of physical determinism, drawing on ideas from mathematical logic and computability theory. We outline a programme of investigating these notions of determinism in detail for specific, precisely articulated physical theories. We make a s ..."
Abstract
 Add to MetaCart
We discuss several ways of making precise the informal concept of physical determinism, drawing on ideas from mathematical logic and computability theory. We outline a programme of investigating these notions of determinism in detail for specific, precisely articulated physical theories. We make a start on our programme by proposing a general logical framework for describing physical theories, and analysing several possible formulations of a simple Newtonian theory from the point of view of determinism. Our emphasis throughout is on clarifying the precise physical and metaphysical assumptions that typically underlie a claim that some physical theory is ‘deterministic’. A sequel paper is planned, in which we shall apply similar methods to the analysis of other physical theories. Along the way, we discuss some possible repercussions of this kind of investigation for both physics and logic. 1
1 Quantum algorithmic information theory
, 2008
"... The agenda of quantum algorithmic information theory, ordered ‘topdown, ’ is the quantum halting amplitude, followed by the quantum algorithmic information content, which in turn requires the theory of quantum computation. The fundamental atoms processed by quantum computation are the quantum bits ..."
Abstract
 Add to MetaCart
The agenda of quantum algorithmic information theory, ordered ‘topdown, ’ is the quantum halting amplitude, followed by the quantum algorithmic information content, which in turn requires the theory of quantum computation. The fundamental atoms processed by quantum computation are the quantum bits which are dealt with in quantum information theory. The theory of quantum computation will be based upon a model of universal quantum computer whose elementary unit is a twoport interferometer capable of arbitrary U(2) transformations. Basic to all these considerations is quantum theory, in particular Hilbert space quantum mechanics. 1 Information is physical, so is computation qait.tex The reasoning in constructive mathematics [17, 18, 19] and recursion theory, at least insofar as their applicability to worldly things is concerned, makes implicit assumptions about the operationalizability of the entities of discourse. It is this postulated correspondence between practical and theoretical objects, subsumed by the ChurchTuring thesis, which confers power to the formal methods. Therefore, any finding in physics concerns the formal sciences; at least insofar as
Contents
, 2008
"... Different types of physical unknowables are discussed. Provable unknowables are derived from reduction to problems which are known to be recursively unsolvable. Recent series solutions to the nbody problem and related to it, chaotic systems, may have no computable radius of convergence. Quantum unk ..."
Abstract
 Add to MetaCart
Different types of physical unknowables are discussed. Provable unknowables are derived from reduction to problems which are known to be recursively unsolvable. Recent series solutions to the nbody problem and related to it, chaotic systems, may have no computable radius of convergence. Quantum unknowables include the random occurrence of single events, complementarity and value indefiniteness.