Button, T;
(2009)
Hyperloops Do Not Threaten the Notion of an Effective Procedure.
In: AmbosSpies, K and Lowe, B and Merkle, W, (eds.)
Mathematical Theory and Computational Practice.
(pp. pp. 68-78).
Springer: Berlin, Heidelberg, Germany.
Preview |
Text
Button_(2009)HyperloopsWebArchive.pdf - Accepted Version Download (183kB) | Preview |
Abstract
This paper develops my (forthcoming) criticisms of the philosophical significance of a certain sort of infinitary computational process, a hyperloop. I start by considering whether hyperloops suggest that “effectively computable” is vague (in some sense). I then consider and criticise two arguments by Hogarth, who maintains that hyperloops undermine the very idea of effective computability. I conclude that hyperloops, on their own, cannot threaten the notion of an effective procedure.
Type: | Proceedings paper |
---|---|
Title: | Hyperloops Do Not Threaten the Notion of an Effective Procedure |
Event: | CiE 2009: Conference on Computability in Europe |
Location: | Heidelberg, GERMANY |
Open access status: | An open access version is available from UCL Discovery |
DOI: | 10.1007/978-3-642-03073-4_8 |
Publisher version: | https://doi.org/10.1007/978-3-642-03073-4_8 |
Language: | English |
Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL SLASH UCL > Provost and Vice Provost Offices > UCL SLASH > Faculty of Arts and Humanities UCL > Provost and Vice Provost Offices > UCL SLASH > Faculty of Arts and Humanities > Dept of Philosophy |
URI: | https://discovery.ucl.ac.uk/id/eprint/10091254 |
![](/style/images/loading.gif)
![](/style/images/loading.gif)
![](/style/images/loading.gif)
1. | ![]() | 8 |
2. | ![]() | 7 |
3. | ![]() | 3 |
4. | ![]() | 3 |
5. | ![]() | 2 |
6. | ![]() | 2 |
7. | ![]() | 1 |
8. | ![]() | 1 |
9. | ![]() | 1 |
10. | ![]() | 1 |
Archive Staff Only
![]() |
View Item |