- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Degrees of total algorithms versus degrees of honest functions
In S. Barry Cooper (ed.), How the World Computes. pp. 422--431 (2012)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
A jump operator on honest subrecursive degrees.Lars Kristiansen - 1998 - Archive for Mathematical Logic 37 (2):105-125.
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
Infima of d.r.e. degrees.Jiang Liu, Shenling Wang & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (1):35-49.
Benign cost functions and lowness properties.Noam Greenberg & André Nies - 2011 - Journal of Symbolic Logic 76 (1):289 - 312.
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees.Klaus Ambos-Spies & Ding Decheng - 1994 - Mathematical Logic Quarterly 40 (3):287-317.
Limit lemmas and jump inversion in the enumeration degrees.Evan J. Griffiths - 2003 - Archive for Mathematical Logic 42 (6):553-562.
On the very idea of degrees of truth.Timothy Cleveland - 1997 - Australasian Journal of Philosophy 75 (2):218 – 221.
The jump operation for structure degrees.V. Baleva - 2005 - Archive for Mathematical Logic 45 (3):249-265.
Randomness, Lowness and Degrees.George Barmpalias, Andrew E. M. Lewis & Mariya Soskova - 2008 - Journal of Symbolic Logic 73 (2):559 - 577.
Elementary Differences between the (2p)-C. E. and the (2p + 1)-C. E. Enumeration Degrees.I. Sh Kalimullin - 2007 - Journal of Symbolic Logic 72 (1):277 - 284.
The distribution of the generic recursively enumerable degrees.Ding Decheng - 1992 - Archive for Mathematical Logic 32 (2):113-135.
The Isolated D. R. E. Degrees are Dense in the R. E. Degrees.Geoffrey Laforte - 1996 - Mathematical Logic Quarterly 42 (1):83-103.
Maximal contiguous degrees.Peter Cholak, Rod Downey & Stephen Walk - 2002 - Journal of Symbolic Logic 67 (1):409-437.
Analytics
Added to PP
2014-01-28
Downloads
6 (#1,425,536)
6 months
2 (#1,263,261)
2014-01-28
Downloads
6 (#1,425,536)
6 months
2 (#1,263,261)
Historical graph of downloads
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge, Mass.: MIT Press.
A Uniform Approach to Fundamental Sequences and Hierarchies.Wilfried Buchholz, Adam Cichon & Andreas Weiermann - 1994 - Mathematical Logic Quarterly 40 (2):273-286.
Streamlined subrecursive degree theory.Lars Kristiansen, Jan-Christoph Schlage-Puchta & Andreas Weiermann - 2012 - Annals of Pure and Applied Logic 163 (6):698-716.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-hc2g5 uwo