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. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Button, T. (2009). Hyperloops do not threaten the notion of an effective procedure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5635 LNCS, pp. 68–78). https://doi.org/10.1007/978-3-642-03073-4_8
Mendeley helps you to discover research relevant for your work.