Computability in Europe 2008

, &
Archive for Mathematical Logic 49 (2):119-121 (2010)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1007/s00153-009-0166-y

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

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

Computability in Europe 2009.Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss & Benedikt Löwe - 2012 - Annals of Pure and Applied Logic 163 (5):483-484.
Computability in Europe 2011.Sam Buss, Benedikt Löwe, Dag Normann & Ivan Soskov - 2013 - Annals of Pure and Applied Logic 164 (5):509-510.
Computability in Europe 2010.Fernando Ferreira, Martin Hyland, Benedikt Löwe & Elvira Mayordomo - 2012 - Annals of Pure and Applied Logic 163 (6):621-622.
Computability and continuity in computable metric partial algebras equipped with computability structures.Fredrik Dahlgren - 2004 - Mathematical Logic Quarterly 50 (4):486.
6th Conference on Computability in Europe "Programs, Proofs, Processes".Fernando Ferreira - 2011 - Bulletin of Symbolic Logic 17 (3):478-479.
Computability and Complexity: From a Programming Perspective Vol. 21.N. D. Jones - 1997 - MIT Press.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Introduction to Computability Theory.D. Normann - 2010
Computability Theory.S. Barry Cooper - 2003 - Chapman & Hall.
Remarks on the development of computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.
Turing-, human- and physical computability: An unasked question. [REVIEW]Eli Dresner - 2008 - Minds and Machines 18 (3):349-355.
Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press.
Review: Dimiter G. Skordev, Computability in Combinatory Spaces. An Algebraic Generalization of Abstract First Order Computability. [REVIEW]Dag Normann - 1995 - Journal of Symbolic Logic 60 (2):695-696.
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
Lp -Computability.Ning Zhong & Bing-Yu Zhang - 1999 - Mathematical Logic Quarterly 45 (4):449-456.

Analytics

Added to PP
2013-11-23

Downloads
32 (#485,568)

6 months
9 (#298,039)

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