Computability via Approximations

&
Bulletin of Symbolic Logic 5 (1):168 (1999)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,369

External links

  • This entry has no external links. Add one.
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

Approximations and truth spaces.Jean-Pierre Marquis - 1991 - Journal of Philosophical Logic 20 (4):375 - 401.
Computability and continuity in computable metric partial algebras equipped with computability structures.Fredrik Dahlgren - 2004 - Mathematical Logic Quarterly 50 (4):486.
Towards a Philosophy of Approximations in the 'Exact' Sciences.Valentin N. Ostrovsky - 2005 - Hyle 11 (2):101 - 126.
Computation and hypercomputation.Mike Stannett - 2003 - Minds and Machines 13 (1):115-153.
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.
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 and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press.
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
Computability of Self‐Similar Sets.Hiroyasu Kamo & Kiko Kawamura - 1999 - Mathematical Logic Quarterly 45 (1):23-30.
Computability on Regular Subsets of Euclidean Space.Martin Ziegler - 2002 - Mathematical Logic Quarterly 48 (S1):157-181.

Analytics

Added to PP
2014-03-28

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references