Hyperloops do not threaten the notion of an effective procedure

Lecture Notes in Computer Science 5635:68-78 (2009)
  Copy   BIBTEX

Abstract

This paper develops my (BJPS 2009) 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.

Author's Profile

Tim Button
University College London

Analytics

Added to PP
2011-03-20

Downloads
175 (#74,859)

6 months
67 (#68,582)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?