Results 1 - 10
of
14
Composition and Submachine Concepts for Sequential ASMs
- Computer Science Logic (Proceedings of CSL 2000), volume 1862 of LNCS
, 2000
"... We define three composition and structuring concepts which... ..."
Abstract
-
Cited by 27 (11 self)
- Add to MetaCart
We define three composition and structuring concepts which...
Algorithmic randomness, quantum physics, and incompleteness
- PROCEEDINGS OF THE CONFERENCE “MACHINES, COMPUTATIONS AND UNIVERSALITY” (MCU’2004), LECTURES NOTES IN COMPUT. SCI. 3354
, 2004
"... ..."
Abstract State Machines: A unifying view of models of computation and of system design frameworks
- Annals of Pure and Applied Logic
, 2005
"... We capture the principal models of computation and specification in the literature by a uniform set of transparent mathematical descriptions which—starting from scratch—provide the conceptual basis for a comparative study 1. 1 ..."
Abstract
-
Cited by 9 (5 self)
- Add to MetaCart
We capture the principal models of computation and specification in the literature by a uniform set of transparent mathematical descriptions which—starting from scratch—provide the conceptual basis for a comparative study 1. 1
The Church-Turing thesis: Consensus and opposition
- Logical Approaches to Computational Barriers: Second Conference on Computability in Europe, CiE 2006
, 2006
"... Many years ago, I wrote [7]: It is truly remarkable (Gödel...speaks of a kind of miracle) that it has proved possible to give a precise mathematical characterization of the class of processes that can be carried out by purely machanical means. It is in fact the possibility of such a characterization ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
Many years ago, I wrote [7]: It is truly remarkable (Gödel...speaks of a kind of miracle) that it has proved possible to give a precise mathematical characterization of the class of processes that can be carried out by purely machanical means. It is in fact the possibility of such a characterization that underlies the ubiquitous applicability of digital computers. In addition it has made it possible to prove the algorithmic unsolvability of important problems, has provided a key tool in mathematical logic, has made available an array of fundamental models in theoretical computer science, and has been the basis of a rich new branch of mathemtics. A few years later I wrote [8]: Thesubject...isAlanTuring’sdiscoveryoftheuniversal(orall-purpose) digitalcomputerasamathematicalabstraction....Wewill tryto show how this very abstract work helped to lead Turing and John von Neumann to the modern concept of the electronic computer.
The Incomputable Alan Turing
"... The last century saw dramatic challenges to the Laplacian predictability which had underpinned scientific research for around 300 years. Basic to this was Alan Turing’s 1936 discovery (along with Alonzo Church) of the existence of unsolvable problems. This paper focuses on incomputability as a power ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
The last century saw dramatic challenges to the Laplacian predictability which had underpinned scientific research for around 300 years. Basic to this was Alan Turing’s 1936 discovery (along with Alonzo Church) of the existence of unsolvable problems. This paper focuses on incomputability as a powerful theme in Turing’s work and personal life, and examines its role in his evolving concept of machine intelligence. It also traces some of the ways in which important new developments are anticipated by Turing’s ideas in logic.
FROM DESCARTES TO TURING: THE COMPUTATIONAL CONTENT OF SUPERVENIENCE
"... Mathematics can provide precise formulations of relatively vague concepts and problems from the real world, and bring out underlying structure common to diverse scientific areas. Sometimes very natural mathematical concepts lie neglected and not widely understood for many years, before their fundame ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Mathematics can provide precise formulations of relatively vague concepts and problems from the real world, and bring out underlying structure common to diverse scientific areas. Sometimes very natural mathematical concepts lie neglected and not widely understood for many years, before their fundamental relevance is recognised and their explanatory power is fully exploited. The notion of definability in a structure is such a concept, and Turing’s [77] 1939 model of interactive computation provides a fruitful context in which to exercise the usefulness of definability as a powerful and widely applicable source of understanding. In this article we set out to relate this simple idea to one of the oldest and apparently least scientifically approachable of problems — that of realistically modelling how mental properties supervene on physical ones. Mathematics can provide precise formulations of relatively vague concepts and problems from the real world, and bring out underlying structure common to diverse scientific areas. Sometimes very natural mathematical concepts lie neglected and not widely understood for many years, before their fundamental relevance is recognised and their explanatory power is fully exploited. Previously we have argued that the notion of definability in a structure is such a concept, and pointed to Turing’s [77] 1939 model of interactive computation as providing a fruitful context in which to exercise the usefulness of definability as a powerful and widely applicable source of understanding. Below, we relate this simple idea to one of the oldest and apparently least scientifically approachable of problems — that of realistically modelling how mental properties supervene on physical ones. We will first briefly review the origins with René Descartes of mind-body dualism, and the problem of mental causation. We will then summarise the subsequent difficulties encountered, and their current persistence, and the more recent usefulness of the concept of supervenience in
Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory
, 2009
"... ..."
A Review of Mathematical Knowledge Management ⋆
"... Abstract. Mathematical Knowledge Management (MKM), as a field, has seen tremendous growth in the last few years. This period was one where many research threads were started, and the field was defining itself. We believe that we are now in a position to use the MKM body of knowledge as a means to de ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. Mathematical Knowledge Management (MKM), as a field, has seen tremendous growth in the last few years. This period was one where many research threads were started, and the field was defining itself. We believe that we are now in a position to use the MKM body of knowledge as a means to define what MKM is, what it worries about, etc. In this paper, we review the literature of MKM and gather various metadata from these papers. After offering some definitions surrounding MKM, we analyse the metadata we have gathered from these papers, in an effort to cast more light on the field of MKM and its evolution.
Incomputability, Emergence and the Turing Universe
"... Amongst the huge literature concerning emergence, reductionism and mechanism, there is a role for analysis of the underlying mathematical constraints. Much of the speculation, confusion, controversy and descriptive verbiage might be clarified via suitable modelling and theory. The key ingredients we ..."
Abstract
- Add to MetaCart
Amongst the huge literature concerning emergence, reductionism and mechanism, there is a role for analysis of the underlying mathematical constraints. Much of the speculation, confusion, controversy and descriptive verbiage might be clarified via suitable modelling and theory. The key ingredients we bring to this project are the mathematical notions of definability and invariance, a computability theoretic framework in a real-world context, and within that, the modelling of basic causal environments via Turing’s 1939 notion of interactive computation over a structure described in terms of reals. Useful outcomes are: a refinement of what one understands to be a causal relationship, including non-mechanistic, irreversible causal relationships; an appreciation of how the mathematically simple origins of incomputability in definable hierarchies are materialised in the real world; and an understanding of the powerful explanatory role of current computability theoretic developments. The theme of this article concerns the way in which mathematics can structure everyday discussions around a range of important issues — and can also reinforce intuitions about theoretical links between different aspects of the real world. This fits with the widespread sense of excitement and expectation felt in many fields — and of a corresponding confusion — and of a tension characteristic of a Kuhnian paradigm shift. What we have below can be seen as tentative steps towards the sort of mathematical modelling needed for such a shift to be completed. In section 1, we outline the decisive role mathematics played in the birth of modern science; and how, more recently, it has helped us towards a better understanding of the nature and limitations of the scientific enterprise. In section 2, we review how the mathematics brings out inherent contradictions in the Laplacian model of scientific activity. And we look at some of the approaches to dealing
May 2003Experience with Two Systems Supporting Proofs
"... We report on our initial experience exploring Mizar and Isabelle, two quite different systems that support constructing and checking mathematical proofs. We also discuss some issues in the design of such systems. 1 ..."
Abstract
- Add to MetaCart
We report on our initial experience exploring Mizar and Isabelle, two quite different systems that support constructing and checking mathematical proofs. We also discuss some issues in the design of such systems. 1

