Hyperloops Do Not Threaten the Notion of an Effective Procedure

  • Tim Button
Conference paper

DOI: 10.1007/978-3-642-03073-4_8

Volume 5635 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Button T. (2009) Hyperloops Do Not Threaten the Notion of an Effective Procedure. In: Ambos-Spies K., Löwe B., Merkle W. (eds) Mathematical Theory and Computational Practice. CiE 2009. Lecture Notes in Computer Science, vol 5635. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Tim Button
    • 1
  1. 1.Cambridge UniversityUK