Papers
Topics
Authors
Recent
Search
2000 character limit reached

Incomputability after Alan Turing

Published 22 Apr 2013 in math.HO, cs.CC, and cs.LO | (1304.6363v1)

Abstract: Incomputability as a mathematical notion arose from work of Alan Turing and Alonzo Church in the 1930s. Like Turing himself, it attracted less attention than it deserved beyond the confines of mathematics. Today our experiences in computer science, physics, biology, artificial intelligence, economics and the humanities point to the importance of the notion for understanding the world around us. This article takes a Turing centenary look at how the interface between the computable world and the incomputable formed a central theme in Turing's work - from the early establishment of the standard model of the stored program computer, to the late work on emergence of form in nature, and the first approaches to understanding and simulating human intelligence. Turing's thinking was remarkably prescient, and his legacy still impacts on much of our work. The incomputable may turn out to be a specially important part of the legacy, with consequences that Alan Turing himself could not have envisaged.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.