Results 1  10
of
15
Beyond The Universal Turing Machine
, 1998
"... We describe an emerging field, that of nonclassical computability and nonclassical computing machinery. According to the nonclassicist, the set of welldefined computations is not exhausted by the computations that can be carried out by a Turing machine. We provide an overview of the field and a phi ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
We describe an emerging field, that of nonclassical computability and nonclassical computing machinery. According to the nonclassicist, the set of welldefined computations is not exhausted by the computations that can be carried out by a Turing machine. We provide an overview of the field and a philosophical defence of its foundations.
The Broad Conception Of Computation
 American Behavioral Scientist
, 1997
"... A myth has arisen concerning Turing's paper of 1936, namely that Turing set forth a fundamental principle concerning the limits of what can be computed by machine  a myth that has passed into cognitive science and the philosophy of mind, to wide and pernicious effect. This supposed principle, somet ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
A myth has arisen concerning Turing's paper of 1936, namely that Turing set forth a fundamental principle concerning the limits of what can be computed by machine  a myth that has passed into cognitive science and the philosophy of mind, to wide and pernicious effect. This supposed principle, sometimes incorrectly termed the 'ChurchTuring thesis', is the claim that the class of functions that can be computed by machines is identical to the class of functions that can be computed by Turing machines. In point of fact Turing himself nowhere endorses, nor even states, this claim (nor does Church). I describe a number of notional machines, both analogue and digital, that can compute more than a universal Turing machine. These machines are exemplars of the class of nonclassical computing machines. Nothing known at present rules out the possibility that machines in this class will one day be built, nor that the brain itself is such a machine. These theoretical considerations undercut a numb...
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.
Fast Quantum Algorithms for Handling Probabilistic and Interval Uncertainty
, 2003
"... this paper, we show how the use of quantum computing can speed up some computations related to interval and probabilistic uncertainty. We end the paper with speculations on whether (and how) "hypothetic" physical devices can compute NPhard problems faster than in exponential time ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
this paper, we show how the use of quantum computing can speed up some computations related to interval and probabilistic uncertainty. We end the paper with speculations on whether (and how) "hypothetic" physical devices can compute NPhard problems faster than in exponential time
Strong Determinism vs. Computability
 The Foundational Debate, Complexity and Constructivity in Mathematics and
, 1995
"... Are minds subject to laws of physics? Are the laws of physics computable? Are conscious thought processes computable? Currently there is little agreement as to what are the right answers to these questions. Penrose ([41], p. 644) goes one step further and asserts that: a radical new theory is indeed ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Are minds subject to laws of physics? Are the laws of physics computable? Are conscious thought processes computable? Currently there is little agreement as to what are the right answers to these questions. Penrose ([41], p. 644) goes one step further and asserts that: a radical new theory is indeed needed, and I am suggesting, moreover, that this theory, when it is found, will be of an essentially noncomputational character. The aim of this paper is three fold: 1) to examine the incompatibility between the hypothesis of strong determinism and computability, 2) to give new examples of uncomputable physical laws, and 3) to discuss the relevance of Gödel’s Incompleteness Theorem in refuting the claim that an algorithmic theory—like strong AI—can provide an adequate theory of mind. Finally, we question the adequacy of the theory of computation to discuss physical laws and thought processes. 1
Science At the Crossroad Between Randomness and Determinism
, 2000
"... Time and again, man's understanding of Nature is at the crossroad between total worldcomprehension and total randomness. It is suggested that not only are the preferences influenced by the theories and models of today, but also by the very personal subjective inclinations of the people involved ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Time and again, man's understanding of Nature is at the crossroad between total worldcomprehension and total randomness. It is suggested that not only are the preferences influenced by the theories and models of today, but also by the very personal subjective inclinations of the people involved. The second part deals with the principle of selfconsistency and its consequences for totally deterministic systems.
The Complexity of Proving Chaoticity and the ChurchTuring Thesis
, 2010
"... Proving the chaoticity of some dynamical systems is equivalent to solving the hardest problems in mathematics. Conversely, one argues that it is not unconceivable that classical physical systems may “compute the hard or even the incomputable” by measuring observables which correspond to computationa ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Proving the chaoticity of some dynamical systems is equivalent to solving the hardest problems in mathematics. Conversely, one argues that it is not unconceivable that classical physical systems may “compute the hard or even the incomputable” by measuring observables which correspond to computationally hard or even incomputable problems.
Undecidability Everywhere?
, 1996
"... We discuss the question of if and how undecidability might be translatable into physics, in particular with respect to prediction and description, as well as to complementarity games. 1 1 Physics after the incompleteness theorems There is incompleteness in mathematics [22, 63, 65, 13, 9, 12, 51 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We discuss the question of if and how undecidability might be translatable into physics, in particular with respect to prediction and description, as well as to complementarity games. 1 1 Physics after the incompleteness theorems There is incompleteness in mathematics [22, 63, 65, 13, 9, 12, 51]. That means that there does not exist any reasonable (consistent) finite formal system from which all mathematical truth is derivable. And there exists a "huge" number [11] of mathematical assertions (e.g., the continuum hypothesis, the axiom of choice) which are independent of any particular formal system. That is, they as well as their negations are compatible with the formal system. Can such formal incompleteness be translated into physics or the natural sciences in general? Is there some question about the nature of things which is provable unknowable for rational thought? Is it conceivable that the natural phenomena, even if they occur deterministically, do not allow their complete d...
Turing's Omachines, Searle, Penrose and the Brain
"... In his PhD thesis (1938) Turing introduced what he described as 'a new kind of machine'. He called these 'Omachines'. The present paper employs Turing's concept against a number of currently fashionable positions in the philosophy of mind. ..."
Abstract
 Add to MetaCart
In his PhD thesis (1938) Turing introduced what he described as 'a new kind of machine'. He called these 'Omachines'. The present paper employs Turing's concept against a number of currently fashionable positions in the philosophy of mind.
Received (Day Month Year)
"... Accepted (Day Month Year) Communicated by (xxxxxxxxxx) In this paper, we explain why, in our opinion, logic and constructive mathematics are playing – and should play – an important role in the design, understanding, and analysis of unconventional computation. ..."
Abstract
 Add to MetaCart
Accepted (Day Month Year) Communicated by (xxxxxxxxxx) In this paper, we explain why, in our opinion, logic and constructive mathematics are playing – and should play – an important role in the design, understanding, and analysis of unconventional computation.