Results 1  10
of
28
The Impact of the Lambda Calculus in Logic and Computer Science
 BULLETIN OF SYMBOLIC LOGIC
, 1997
"... One of the most important contributions of A. Church to logic is his invention of the lambda calculus. We present the genesis of this theory and its two major areas of application: the representation of computations and the resulting functional programming languages on the one hand and the represent ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
One of the most important contributions of A. Church to logic is his invention of the lambda calculus. We present the genesis of this theory and its two major areas of application: the representation of computations and the resulting functional programming languages on the one hand and the representation of reasoning and the resulting systems of computer mathematics on the other hand.
A NATURAL AXIOMATIZATION OF COMPUTABILITY AND PROOF OF CHURCH’S THESIS
"... Abstract. Church’s Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turingcomputable numeric functions. The Abstract State Machine Theorem states that every classical algorithm is behaviorally e ..."
Abstract

Cited by 23 (10 self)
 Add to MetaCart
Abstract. Church’s Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turingcomputable numeric functions. The Abstract State Machine Theorem states that every classical algorithm is behaviorally equivalent to an abstract state machine. This theorem presupposes three natural postulates about algorithmic computation. Here, we show that augmenting those postulates with an additional requirement regarding basic operations gives a natural axiomatization of computability and a proof of Church’s Thesis, as Gödel and others suggested may be possible. In a similar way, but with a different set of basic operations, one can prove Turing’s Thesis, characterizing the effective string functions, and—in particular—the effectivelycomputable functions on string representations of numbers.
The Quantum Coin Toss  Testing Microphysical Undecidability
, 1990
"... A critical review of randomness criteria shows that nogo theorems severely restrict the validity of actual "proofs" of undecidability. It is suggested to test microphysical undecidability by physical processes with low extrinsic complexity, such as polarized laser light. The publication a ..."
Abstract

Cited by 21 (17 self)
 Add to MetaCart
A critical review of randomness criteria shows that nogo theorems severely restrict the validity of actual "proofs" of undecidability. It is suggested to test microphysical undecidability by physical processes with low extrinsic complexity, such as polarized laser light. The publication and distribution of a sequence of pointer readings generated by such methods is proposed. Unlike any pseudorandom sequence generated by finite deterministic automata, the postulate of microscopic randomness implies that this sequence can be safely applied for all purposes requireing stochasticity and high complexity.
Machines, logic and quantum physics
 BULLETIN OF SYMBOLIC LOGIC
, 1999
"... Though the truths of logic and pure mathematics are objective and independent of any contingent facts or laws of nature, our knowledge of these truths depends entirely on our knowledge of the laws of physics. Recent progress in the quantum theory of computation has provided practical instances of th ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Though the truths of logic and pure mathematics are objective and independent of any contingent facts or laws of nature, our knowledge of these truths depends entirely on our knowledge of the laws of physics. Recent progress in the quantum theory of computation has provided practical instances of this, and forces us to abandon the classical view that computation, and hence mathematical proof, are purely logical notions independent of that of computation as a physical process. Henceforward, a proof must be regarded not as an abstract object or process but as a physical process, a species of computation, whose scope and reliability depend on our knowledge of the physics of the computer concerned.
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.
Prospects for mathematical logic in the twentyfirst century
 BULLETIN OF SYMBOLIC LOGIC
, 2002
"... The four authors present their speculations about the future developments of mathematical logic in the twentyfirst century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently. ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
The four authors present their speculations about the future developments of mathematical logic in the twentyfirst century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.
Church’s Thesis and the Conceptual Analysis of Computability
 Notre Dame Journal of Formal Logic
, 2007
"... ..."
How much can analog and hybrid systems be proved (super)Turing
 Applied Mathematics and Computation
, 2006
"... Church thesis and its variants say roughly that all reasonable models of computation do not have more power than Turing Machines. In a contrapositive way, they say that any model with superTuring power must have something unreasonable. Our aim is to discuss how much theoretical computer science can ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Church thesis and its variants say roughly that all reasonable models of computation do not have more power than Turing Machines. In a contrapositive way, they say that any model with superTuring power must have something unreasonable. Our aim is to discuss how much theoretical computer science can quantify this, by considering several classes of continuous time dynamical systems, and by studying how much they can be proved Turing or superTuring. 1
Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory
, 2009
"... ..."
The Foundations of Psychology  A logicocomputational inquiry into the concept of mind
 DEPARTMENT OF COMPUTER SCIENCE, CARNEGIEMELLON UNIVERSITY
, 1991
"... We compare certain trains of thought in philosophy of mind and artificial intelligence which lead to a remarkable convergence of ideas. Demands from philosophy that psychological theories have predictive power join with demands from artificial intelligence that machines adaptively maintain their own ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We compare certain trains of thought in philosophy of mind and artificial intelligence which lead to a remarkable convergence of ideas. Demands from philosophy that psychological theories have predictive power join with demands from artificial intelligence that machines adaptively maintain their own mental state to suggest a conception of minds as narrowly realized psychological theories. We use this conclusion both to clarify the domains of study and scientific aims of psychology and artificial intelligence, and to suggest some methodological principles for constructing intelligent machines.