Jump to ContentJump to Main Navigation
The Nature of Computation$
Users without a subscription are not able to see the full content.

Cristopher Moore and Stephan Mertens

Print publication date: 2011

Print ISBN-13: 9780199233212

Published to Oxford Scholarship Online: December 2013

DOI: 10.1093/acprof:oso/9780199233212.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 26 May 2020

The Grand Unified Theory of Computation

The Grand Unified Theory of Computation

(p.223) Chapter 7 The Grand Unified Theory of Computation
The Nature of Computation

Moore Cristopher

Oxford University Press

This chapter explores a universal notion of computation, first by describing Charles Babbage's vision of a mechanical device that can perform any calculation as well as David Hilbert's dream of a mechanical procedure capable of proving or refuting any mathematical claim. It then considers the universality of modern computers and the undecidability of certain problems, explores diagonalization and the Halting Problem, and discusses Kurt Gödel's Incompleteness Theorem. It also looks at the three models of computation proposed in the early twentieth century — partial recursive functions, the lambda-calculus, and Turing machines — and show that they are all equivalent to each other and can carry out any conceivable computation. The chapter concludes by considering universal computation and undecidability in tilings of the plane, products of fractions, and the motions of a chaotic system.

Keywords:   computation, Charles Babbage, David Hilbert, universality, undecidability, Halting Problem, Kurt Gödel, Incompleteness Theorem, partial recursive functions, lambda-calculus

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .