The concept of computability

Abstract

I explore the conceptual foundations of Alan Turing’s analysis of computability, which still dominates thinking about computability today. I argue that Turing’s account represents a last vestige of a famous but unsuccessful program in pure mathematics, viz., Hilbert’s formalist program. It is my contention that the plausibility of Turing’s account as an… (More)
DOI: 10.1016/j.tcs.2003.12.012

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics