Mathematical Theory and Computational Practice

Volume 5635 of the series Lecture Notes in Computer Science pp 68-78

Hyperloops Do Not Threaten the Notion of an Effective Procedure

  • Tim ButtonAffiliated withCambridge University

* Final gross prices may vary according to local VAT.

Get Access


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.