Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra

Annals of Pure and Applied Logic 163 (8):1108-1139 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2011.12.030

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

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

Randomness, computability and algebraic specifications.Bakhadyr Khoussainov - 1998 - Annals of Pure and Applied Logic 91 (1):1-15.
Discrete transfinite computation models.Philip D. Welch - 2011 - In S. B. Cooper & Andrea Sorbi (eds.), Computability in Context: Computation and Logic in the Real World. World Scientific. pp. 375--414.
Complexity-theoretic algebra II: Boolean algebras.A. Nerode & J. B. Remmel - 1989 - Annals of Pure and Applied Logic 44 (1-2):71-99.
A transfer theorem in constructive real algebra.Philip Scowcroft - 1988 - Annals of Pure and Applied Logic 40 (1):29-87.
More on real algebra in scott's model.Philip Scowcroft - 1986 - Annals of Pure and Applied Logic 30 (3):277-291.
The proof complexity of linear algebra.Michael Soltys & Stephen Cook - 2004 - Annals of Pure and Applied Logic 130 (1-3):277-323.
Approximation to measurable functions and its relation to probabilistic computation.Ker-I. Ko - 1986 - Annals of Pure and Applied Logic 30 (2):173-200.
The strength of compactness in Computability Theory and Nonstandard Analysis.Dag Normann & Sam Sanders - 2019 - Annals of Pure and Applied Logic 170 (11):102710.
A categorical approach to the theory of computation.Philip S. Mulry - 1989 - Annals of Pure and Applied Logic 43 (3):293-305.
Conditional computability of real functions with respect to a class of operators.Ivan Georgiev & Dimiter Skordev - 2013 - Annals of Pure and Applied Logic 164 (5):550-565.

Analytics

Added to PP
2013-10-27

Downloads
13 (#288,494)

6 months
40 (#385,383)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Inside the Muchnik degrees I: Discontinuity, learnability and constructivism.K. Higuchi & T. Kihara - 2014 - Annals of Pure and Applied Logic 165 (5):1058-1114.

Add more citations

References found in this work

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Recursion-theoretic hierarchies.Peter G. Hinman - 1978 - New York: Springer Verlag.
Descriptive Set Theory.Richard Mansfield - 1981 - Journal of Symbolic Logic 46 (4):874-876.
Closed choice and a uniform low basis theorem.Vasco Brattka, Matthew de Brecht & Arno Pauly - 2012 - Annals of Pure and Applied Logic 163 (8):986-1008.

View all 13 references / Add more references