Turing Centenary Conference: How the World Computes

, , &
Annals of Pure and Applied Logic 165 (9):1353-1354 (2014)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2014.04.007

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,757

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

S. Barry Cooper and Andrew Hodges , The Once and Future Turing: Computing the World. Cambridge University Press, 2016. xviii + 379 pp.— therein: - Martin Davis. Algorithms, Equations, and Logic. pp. 4–19. - J.M.E. Hyland. The Forgotten Turing. pp. 20–33. - Andrew R. Booker. Turing and the Primes. pp. 34–52. - Ueli Maurer. Cryptography and Computation after Turing. pp. 53–77. - Kanti V. Mardia and S. Barry Cooper. Alan Turing and Enigmatic Statistics. pp. 78–89. - Stephen Wolfram. What Alan Turing Might Have Discovered. pp. 92–105. - Christof Teuscher. Designed versus Intrinsic Computation. pp. 106–116. - Solomon Feferman. Turing’s ‘Oracle’: From Absolute to Relative Computability and Back. pp. 300–334. - P.D. Welch. Turing Transcendent: Beyond the Event Horizon. pp. 335–360. - Roger Penrose. On Attempting to Model the Mathematical Mind. pp. 361–378. [REVIEW]Alasdair Urquhart - 2016 - Bulletin of Symbolic Logic 22 (3):354-356.
Π10 classes and minimal degrees.Marcia J. Groszek & Theodore A. Slaman - 1997 - Annals of Pure and Applied Logic 87 (2):117-144.
There is no recursive link between the k-size of a model and its cardinality.R. Barker - 2002 - Annals of Pure and Applied Logic 118 (3):235-247.
Turing meets Schanuel.Angus Macintyre - 2016 - Annals of Pure and Applied Logic 167 (10):901-938.
Turing reducibility in the fine hierarchy.Alexander G. Melnikov, Victor L. Selivanov & Mars M. Yamaleev - 2020 - Annals of Pure and Applied Logic 171 (7):102766.
Tracing and domination in the Turing degrees.George Barmpalias - 2012 - Annals of Pure and Applied Logic 163 (5):500-505.
Computable fields and the bounded Turing reduction.Rebecca M. Steiner - 2012 - Annals of Pure and Applied Logic 163 (6):730-742.
Separating families and order dimension of Turing degrees.Ashutosh Kumar & Dilip Raghavan - 2021 - Annals of Pure and Applied Logic 172 (5):102911.
Π 1 0 classes, L R degrees and Turing degrees.George Barmpalias, Andrew E. M. Lewis & Frank Stephan - 2008 - Annals of Pure and Applied Logic 156 (1):21-38.
Towards characterizing the >ω2-fickle recursively enumerable Turing degrees.Liling Ko - 2024 - Annals of Pure and Applied Logic 175 (4):103403.

Analytics

Added to PP
2015-01-22

Downloads
35 (#652,794)

6 months
11 (#362,865)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Benedikt Löwe
University of Amsterdam

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references