Formulas for Computable and Non-Computable Functions

Rose-Hulman Undergraduate Mathematics Journal 7 (2) (2006)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive

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

Similar books and articles

Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Computable structures and the hyperarithmetical hierarchy.C. J. Ash - 2000 - New York: Elsevier. Edited by J. Knight.
Uncomputably Noisy Ergodic Limits.Jeremy Avigad - 2012 - Notre Dame Journal of Formal Logic 53 (3):347-350.
The computable dimension of trees of infinite height.Russell Miller - 2005 - Journal of Symbolic Logic 70 (1):111-141.
The Block Relation in Computable Linear Orders.Michael Moses - 2011 - Notre Dame Journal of Formal Logic 52 (3):289-305.
Tailoring recursion for complexity.Erich Grädel & Yuri Gurevich - 1995 - Journal of Symbolic Logic 60 (3):952-969.
WHAT IS. . . a Halting Probability?Cristian S. Calude - 2010 - Notices of the AMS 57:236-237.
Euclidean Functions of Computable Euclidean Domains.Rodney G. Downey & Asher M. Kach - 2011 - Notre Dame Journal of Formal Logic 52 (2):163-172.
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
Computable models.Raymond Turner - 2009 - London: Springer.

Analytics

Added to PP
2011-05-19

Downloads
467 (#39,502)

6 months
285 (#7,351)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Samuel Allen Alexander
Ohio State University (PhD)

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references