Results 1  10
of
11
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.
Contexts in quantum, classical and partition logic
 In Handbook of Quantum Logic
, 2006
"... Contexts are maximal collections of comeasurable observables “bundled together ” to form a “quasiclassical miniuniverse. ” Different notions of contexts are discussed for classical, quantum and generalized urn–automaton systems. PACS numbers: 02.10.v,02.50.Cw,02.10.Ud ..."
Abstract

Cited by 8 (7 self)
 Add to MetaCart
Contexts are maximal collections of comeasurable observables “bundled together ” to form a “quasiclassical miniuniverse. ” Different notions of contexts are discussed for classical, quantum and generalized urn–automaton systems. PACS numbers: 02.10.v,02.50.Cw,02.10.Ud
Set Theory and Physics
 FOUNDATIONS OF PHYSICS, VOL. 25, NO. 11
, 1995
"... Inasmuch as physical theories are formalizable, set theory provides a framework for theoretical physics. Four speculations about the relevance of set theoretical modeling for physics are presented: the role of transcendental set theory (i) hr chaos theory, (ii) for paradoxical decompositions of soli ..."
Abstract

Cited by 8 (7 self)
 Add to MetaCart
Inasmuch as physical theories are formalizable, set theory provides a framework for theoretical physics. Four speculations about the relevance of set theoretical modeling for physics are presented: the role of transcendental set theory (i) hr chaos theory, (ii) for paradoxical decompositions of solid threedimensional objects, (iii) in the theory of effective computability (ChurchTurhrg thesis) related to the possible "solution of supertasks," and (iv) for weak solutions. Several approaches to set theory and their advantages and disadvatages for" physical applications are discussed: Cantorian "naive" (i.e., nonaxiomatic) set theory, contructivism, and operationalism, hr the arrthor's ophrion, an attitude of "suspended attention" (a term borrowed from psychoanalysis) seems most promising for progress. Physical and set theoretical entities must be operationalized wherever possible. At the same thne, physicists shouM be open to "bizarre" or "mindboggling" new formalisms, which treed not be operationalizable or testable at the thne of their " creation, but which may successfully lead to novel fields of phenomenology and technology.
Complexity: A LanguageTheoretic Point of View
, 1995
"... this paper (see the discussion in [51, 58, 70, 126, 127, 120, 121, 130]); in what follows we shall superficially review this topic in connection with the related question: can computers think? ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
this paper (see the discussion in [51, 58, 70, 126, 127, 120, 121, 130]); in what follows we shall superficially review this topic in connection with the related question: can computers think?
How to acknowledge hypercomputation?
, 2007
"... We discuss the question of how to operationally validate whether or not a “hypercomputer” performs better than the known discrete computational models. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We discuss the question of how to operationally validate whether or not a “hypercomputer” performs better than the known discrete computational models.
and
, 712
"... We discuss the question of how to operationally validate whether or not a “hypercomputer ” performs better than the known discrete computational models. 1 ..."
Abstract
 Add to MetaCart
We discuss the question of how to operationally validate whether or not a “hypercomputer ” performs better than the known discrete computational models. 1
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.
The extent of computation in MalamentHogarth
, 2008
"... We analyse the extent of possible computations following Hogarth [7] in MalamentHogarth (MH) spacetimes, and Etesi and Németi [3] in the special subclass containing rotating Kerr black holes. [7] had shown that any arithmetic statement could be resolved in a suitable MH spacetime. [3] had shown tha ..."
Abstract
 Add to MetaCart
We analyse the extent of possible computations following Hogarth [7] in MalamentHogarth (MH) spacetimes, and Etesi and Németi [3] in the special subclass containing rotating Kerr black holes. [7] had shown that any arithmetic statement could be resolved in a suitable MH spacetime. [3] had shown that some ∀ ∃ relations on natural numbers which are neither universal nor couniversal, can be decided in Kerr spacetimes, and had asked specifically as to the extent of computational limits there. The purpose of this note is to address this question, and further show that MH spacetimes can compute far beyond the arithmetic: effectively Borel statements (so hyperarithmetic in second order number theory, or the structure of analysis) can likewise be resolved: Theorem A. If H is any hyperarithmetic predicate on integers, then there is an MH spacetime in which any query?n ∈ H? can be computed. In one sense this is best possible, as there is an upper bound to computational ability in any spacetime which is thus a universal constant of the spacetime M. Theorem C. Assuming the (modest and standard) requirement that spacetime manifolds be paracompact and Hausdorff, for any MH spacetime M there will be a countable ordinal upper bound, w(M), on the complexity of questions in the Borel hierarchy resolvable in it. 1
12345efghi UNIVERSITY OF WALES SWANSEA REPORT SERIES
"... Newtonian mechanics and infinitely parallel computation by ..."