To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
This chapter examines the foundations and limits of computation and their implications for artificial intelligence. It begins with the Entscheidungsproblem and Alan Turing’s formulation of the universal Turing machine, introducing the idea that computation itself can be studied independently of any physical machine. The chapter explains the halting problem and related undecidability results, showing that some well-defined questions cannot be answered by any algorithm, even in principle. It then turns to computational complexity, distinguishing between problems that are solvable in theory and those that are solvable efficiently, and introduces the P versus NP problem as a central open question. The chapter explores how computational hardness can function not only as a limitation but also as a resource, underpinning modern cryptography through one-way functions and key-exchange protocols. Finally, the discussion turns to artificial intelligence, contrasting early rule-based approaches with modern machine learning and neural networks. Recent advances in deep learning and large language models are presented as the culmination of decades of theoretical insight, highlighting both their remarkable capabilities and the enduring structural limits imposed by computation itself.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.