## From Hypocomputation to Hypercomputation (2008)

### BibTeX

@MISC{Love08fromhypocomputation,

author = {David Love},

title = {From Hypocomputation to Hypercomputation},

year = {2008}

}

### OpenURL

### Abstract

Hypercomputational formal theories will, clearly, be both structurally and foundationally different from the formal theories underpinning computational theories. However, many of the maps that might guide us into this strange realm have been lost. So little work has been done recently in the area of metamathematics, and so many of the previous results have been folded into other theories, that we are in danger of loosing an appreciation of the broader structure of formal theories. As an aid to those looking to develop hypercomputational theories, we will briefly survey the known landmarks both inside and outside the borders of computational theory. We will not focus in this paper on why the structure of formal theory looks the way it does. Instead we will focus on what this structure looks like, moving from hypocomputational, through traditional computational theories, and then beyond to hypercomputational theories.

### Citations

1229 |
On computable numbers, with an application to the “Entscheidungsproblem
- Turing
- 1936
(Show Context)
Citation Context ...stance, many presentations of computational theory make use of abstract machines first proposed by Alan Turing in his 1936 paper On Computable Numbers, With An Application To The Entscheidungsproblem =-=[12, 30]-=-. We will not go into the details of the machines proposed by Turing 2shere ⋆ , other than to note they are universally popular as means of presenting results in computational theory. Although univers... |

290 |
Formal languages and their relation to automata
- Hopcroft, Ullman
- 1969
(Show Context)
Citation Context ...he a-machine and those of the o-machine can be used to produce a variety of computational automata. As the details of these automata, and the distinctions between them, are well studied and described =-=[16, 27, 29]-=-, we will not discuss them further in this paper. 5 HYPERCOMPUTATION In general, then, the machine void (or “tape”) is only viewed indirectly by the machine. Instead, the machine only has direct acces... |

281 |
An unsolvable problem of elementary number theory
- Church
- 1936
(Show Context)
Citation Context ... Church, creator of the first modern computational theory, defined his famous thesis relating effective decidable predicates (formal logic) to effectively calculable functions (number theory) in 1936 =-=[7]-=-,[19, §60]. This thesis is now known as Church’s Thesis (or, occasionally, the Church-Turing Thesis after applying Church’s arguments to the model of computation developed by Alan Turing), and its pro... |

200 |
Structured design
- Stevens, Myers, et al.
- 1974
(Show Context)
Citation Context ...r Logical Modules that perform similar functions are put together into a single module Coincidental Parts of a module are not related by simply bundled into a single module TABLE 2 Levels of Cohesion =-=[21, 22, 25, 28]-=- 29 Cohesion Level Very High Very High High Medium Medium Medium Low Very LowsM1 f(A) f(B) f(C) f(D) (a) Design 1 FIGURE 7 Two Equivalent Module Designs M10 M11 f(A) f(B) M12 M13 f(C) f(D) (b) Design ... |

128 |
Systems of logic based on ordinals, in R
- Turing
(Show Context)
Citation Context ... general structure of formal theories to computational theories, we will start with Alan Turing’s consideration of the ordinal sequence, published in his 1939 paper Systems of Logic Based on Ordinals =-=[31]-=-. In Systems of Logic Turing builds on certain results in number theory studied ¶¶ In computational theory, validity and truth are distinct (if related) concepts. Validity simply means we have some ex... |

102 |
The Practical Guide to Structured Systems Design
- Page-Jones
- 1988
(Show Context)
Citation Context ...r Logical Modules that perform similar functions are put together into a single module Coincidental Parts of a module are not related by simply bundled into a single module TABLE 2 Levels of Cohesion =-=[21, 22, 25, 28]-=- 29 Cohesion Level Very High Very High High Medium Medium Medium Low Very LowsM1 f(A) f(B) f(C) f(D) (a) Design 1 FIGURE 7 Two Equivalent Module Designs M10 M11 f(A) f(B) M12 M13 f(C) f(D) (b) Design ... |

63 |
Process Patterns - Building Large-Scale Systems Using Object
- Ambler
- 1998
(Show Context)
Citation Context ... first defined by Glenford Myers and Larry Constantine in the early 1970s. Broadly, “coupling is a measure of how connected two items are, and cohesion is a measure of how much something makes sense” =-=[1]-=-. While this definition maybe vague, many researchers have attempted to make use of these metrics, leading to the ‘definition’ of cohesion shown in Table 2. While cohesion may be popular in both progr... |

55 |
2003 [1710]. A Treatise Concerning the Principles of Human Knowledge
- Berkeley
(Show Context)
Citation Context ...ms using only axiomatic formal theory. We will not deal here in detail with the objections to an axiomatic foundation of mathematics; only noting in passing that the axiomatic view is not uncontested =-=[5, 15]-=-. Moreover, since the 1930s the boundary of axiomatic formal theory has not changed. It seems at least possible, then, for the older view of formal theory to offer something in our search for a more g... |

41 |
Reliable Software Through Composite Design
- Myers
- 1975
(Show Context)
Citation Context ...r Logical Modules that perform similar functions are put together into a single module Coincidental Parts of a module are not related by simply bundled into a single module TABLE 2 Levels of Cohesion =-=[21, 22, 25, 28]-=- 29 Cohesion Level Very High Very High High Medium Medium Medium Low Very LowsM1 f(A) f(B) f(C) f(D) (a) Design 1 FIGURE 7 Two Equivalent Module Designs M10 M11 f(A) f(B) M12 M13 f(C) f(D) (b) Design ... |

37 |
The Church–Turing thesis
- Copeland
- 1997
(Show Context)
Citation Context ...-Turing Thesis after applying Church’s arguments to the model of computation developed by Alan Turing), and its proof remains one of the central problems of modern mathematics [6, 10] and computation =-=[9]-=-. 6sIf Tarski’s view is correct, then it would also seem to rule out hypercomputational theories, since these break certain accepted properties of formal theories || . Nonetheless, it appears Tarski’s... |

26 |
Finite Automata
- Barzdin
- 1973
(Show Context)
Citation Context ...he a-machine and those of the o-machine can be used to produce a variety of computational automata. As the details of these automata, and the distinctions between them, are well studied and described =-=[16, 27, 29]-=-, we will not discuss them further in this paper. 5 HYPERCOMPUTATION In general, then, the machine void (or “tape”) is only viewed indirectly by the machine. Instead, the machine only has direct acces... |

15 | Computation and hypercomputation - Stannett - 2003 |

14 |
The Confluence of Ideas
- Gandy
- 1988
(Show Context)
Citation Context ...stance, many presentations of computational theory make use of abstract machines first proposed by Alan Turing in his 1936 paper On Computable Numbers, With An Application To The Entscheidungsproblem =-=[12, 30]-=-. We will not go into the details of the machines proposed by Turing 2shere ⋆ , other than to note they are universally popular as means of presenting results in computational theory. Although univers... |

11 |
Introduction to Metamathematics, volume 1 of Biblioteca Mathematica
- Kleene
- 1952
(Show Context)
Citation Context ...original sense of David Hilbert: and Hilbert, in ‡ For an accessible introduction to metamathematics, together with the main results and theories, see Stephen Kleene’s Introduction to Metamathematics =-=[19]-=-. Kleene also gives an excellent summary of the history and motivation for metamathematics in Chapter III of his Introduction, A Critique of Mathematical Reasoning. Another good commentary on the earl... |

8 |
The logicist foundation of mathematics
- Carnap
- 1931
(Show Context)
Citation Context ...occasionally, the Church-Turing Thesis after applying Church’s arguments to the model of computation developed by Alan Turing), and its proof remains one of the central problems of modern mathematics =-=[6, 10]-=- and computation [9]. 6sIf Tarski’s view is correct, then it would also seem to rule out hypercomputational theories, since these break certain accepted properties of formal theories || . Nonetheless,... |

6 |
Hilbert’s Program: An Essay on
- Detlefsen
- 1986
(Show Context)
Citation Context ...vered a large number of useful formal theories containing paradoxes [19, Chapter III, §11]. Indeed David Hilbert started his metamathematical program to find a paradox free foundation for mathematics =-=[11]-=-. Modern developments in mathematics have largely followed Hilbert in forbidding paradoxes in formal theories. For instance Georg Cantor’s (naïve) set theory contains a number of interesting paradoxes... |

4 | 2002), Paradoxes from A to Z - Clark |

2 |
The Intuitionist Foundations of Mathematics
- Heyting
- 1964
(Show Context)
Citation Context ...ms using only axiomatic formal theory. We will not deal here in detail with the objections to an axiomatic foundation of mathematics; only noting in passing that the axiomatic view is not uncontested =-=[5, 15]-=-. Moreover, since the 1930s the boundary of axiomatic formal theory has not changed. It seems at least possible, then, for the older view of formal theory to offer something in our search for a more g... |

2 |
A note on computation. Awaiting journal acceptance
- Love
- 2006
(Show Context)
Citation Context ...ties exist, usually referred to as the arithmetic hierarchy. In an unpublished paper of the author, we show that this same basic scheme can be used to describe all members of the arithmetic hierarchy =-=[20]-=-. 19sBut what if the metatheory does not present the para-description in a manner consistent with the machine description? Obviously if the metatheory fails to uphold both the completeness and closure... |

2 |
tarski: Semantic shift, heuristic shift in metamathematics
- Sinaceur, Alfred
- 2001
(Show Context)
Citation Context ...ng weight of evidence in favour of equating formal theory and axiomatic theory led Alfred Tarski to denounce any separation between the (formal) methods of David Hilbert’s and the rest of mathematics =-=[24]-=-: In [Tarski’s] view, metamathematics became similar to any mathematical discipline. Not only its concepts and results can be mathematized, but they actually can be integrated into mathematics.. . . T... |

1 |
Remarks on the Definition and
- Curry
- 1964
(Show Context)
Citation Context ...occasionally, the Church-Turing Thesis after applying Church’s arguments to the model of computation developed by Alan Turing), and its proof remains one of the central problems of modern mathematics =-=[6, 10]-=- and computation [9]. 6sIf Tarski’s view is correct, then it would also seem to rule out hypercomputational theories, since these break certain accepted properties of formal theories || . Nonetheless,... |

1 |
In defence of adhocary
- Glass
- 1993
(Show Context)
Citation Context ...atic formal theories. But this requires hiding the assumptions that “almost” match the formal axioms of the theory with the machine description, making it hard to reason about the machine’s behaviour =-=[13]-=-. If we focused instead on hypocomputational formal theories, we might be able to reason more flexibly about the machine behaviour: as long as we don’t expect perfection. Hypocomputers are thus an une... |

1 | Parting Software and Program Design
- King
- 2004
(Show Context)
Citation Context ...e been proposed, giving a potentially vast pool of methods to consider. Happily, though, all the methods in this pool rest on only a few basic assumptions about the nature of the software description =-=[17]-=-. We can 27ssummarise these assumptions in Table 1. Of these categories, only design methods from the formal strand assume a complete and closed description. Given the reliance of hypercomputation on ... |

1 |
Around Gödel’s Theorem
- Podnieks
- 1992
(Show Context)
Citation Context ...nships between the objects of the theory exactly ‡‡ Closure and completeness may be the ideal of any formal theory, but most known axiomatic formal theories are not simultaneously closed and complete =-=[23]-=-. Note that closure and completeness are binary properties in an axiomatic formal theory — you can’t have an axiomatic theory that is “almost complete” or “almost closed”. Formal theories failing the ... |

1 |
Abstract Automata — Theories of Deterministic, Non-Deterministic and Stochastic Automata
- Starke
- 1972
(Show Context)
Citation Context ...he a-machine and those of the o-machine can be used to produce a variety of computational automata. As the details of these automata, and the distinctions between them, are well studied and described =-=[16, 27, 29]-=-, we will not discuss them further in this paper. 5 HYPERCOMPUTATION In general, then, the machine void (or “tape”) is only viewed indirectly by the machine. Instead, the machine only has direct acces... |

1 |
An Axiomatization of Set Theory, chapter
- Neumann
- 1967
(Show Context)
Citation Context ...or’s naïve set theory and modern axiomatic theory. For a discussion of later work on axiomatic set theory using this definition of ordinals see von Nuemann’s own definition of an axiomatic set theory =-=[33]-=-, and Jean van Heijenoort’s commentary on von Nuemann’s 1923 paper [32, pp. 346– 347]. For convenience we will use the usual modern notation for the empty set (∅), rather than the previously common no... |

1 |
On the Introduction of Transfinite Numbers, chapter
- Neumann
- 1967
(Show Context)
Citation Context ... having by definition no objects or elements as members. Yet it still has form; enough, at least to define itself and the ordinal numbers. We can use this form to obtain the ordinal number as follows =-=[34]-=-. First we start with the empty set itself, and define this to be equal to the ordinal 0 0 = ∅, we can then obtain the next ordinal by defining it as the set including the previous ordinal. Since ∅ is... |