Show Summary Details

p. 10014. Halt! What goes there?locked

  • Graham Priest

Abstract

‘Halt! What goes there?’ looks at some results about what formal reasoning can and can’t do, and some of the philosophical implications of these facts. It considers the workings of computers and explains computations—or algorithms. It asks if there is an algorithm we can apply to a program and inputs to determine whether or not a computation with that program and those inputs terminates, discussing Georg Cantor’s Halting Theorem along with diagonalization. The answer is no and this is what Alan Turing proved. The Church–Turing Thesis, which claims that one can write a computer program for every algorithm, is also considered.

Access to the complete content on Very Short Introductions online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can't find the answer there, please contact us.