Navegar

Colección

Datos Estadísticas

Artículo

Este artículo es de Acceso Abierto y puede ser descargado en su versión final desde nuestro repositorio
Consulte el artículo en la página del editor
Consulte la política de Acceso Abierto del editor

Registro:

Documento: Artículo
Título:Lowness properties and approximations of the jump
Autor:Figueira, S.; Nies, A.; Stephan, F.
Filiación:Department of Computer Science, FCEyN, University of Buenos Aires, Argentina
Department of Computer Science, University of Auckland, New Zealand
Departments of Computer Science and Mathematics, National University of Singapore, Singapore, Singapore
Palabras clave:ω-r.e.; K-triviality; Kolmogorov complexity; Lowness; Traceability; Combinatorial mathematics; Computational complexity; Number theory; ω-r.e.; K-triviality; Kolmogorov complexity; Lowness; Traceability; Approximation theory
Año:2006
Volumen:143
Número:SPEC ISS
Página de inicio:45
Página de fin:57
DOI: http://dx.doi.org/10.1016/j.entcs.2005.05.025
Título revista:Electronic Notes in Theoretical Computer Science
Título revista abreviado:Electron. Notes Theor. Comput. Sci.
ISSN:15710661
PDF:https://bibliotecadigital.exactas.uba.ar/download/paper/paper_15710661_v143_nSPECISS_p45_Figueira.pdf
Registro:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710661_v143_nSPECISS_p45_Figueira

Referencias:

  • Ambos-Spies, K., Jockusch, C., Shore, R., An algebraic decomposition of the recursively enumerable degrees and classes equal to the promptly simple degrees (1984) Transactions of the American Mathematical Society, 281, pp. 109-128
  • Bickford, M., Mills, F., (1982) Lowness Properties of r.e. Sets, , Manuscript, UW Madison
  • Calude, C., Hertling, P., Khoussainov, B., Wang, Y., Recursively enumerable reals and Chaitin's Ω number (1998) Lecture Notes in Computer Science, 1373, pp. 596-606. , STACS 1998
  • Chaitin, G., A theory of program size formally identical to information theory (1975) Journal of the Association for Computing Machinery, 22, pp. 329-340
  • Downey, R., Hirschfeldt, D., Nies, A., Stephan, F., Trivial reals (2003) Proceedings of the 7th and 8th Asian Logic Conferences, pp. 103-131. , World Scientific River Edge, NJ
  • Kjos-Hanssen, B., Merkle, W., Stephan, F., (2005) Kolmogorov Complexity and the Recursion Theorem, , Manuscript
  • Mohrherr, J., A refinement of low n and high n for the r.e. degrees (1986) Z. Math. Logik Grundlag. Math., 32 (1), pp. 5-12
  • Nies, A., Lowness properties and randomness Advances in Math., , to appear
  • Nies, A., Reals which compute little (2002) CDMTCS Research Report, 202. , Dec
  • Odifreddi, P.G., Classical recursion theory (1989) Classical Recursion Theory, 1-2. , North-Holland Amsterdam Elsevier Amsterdam
  • Soare, R., (1987) Recursively Enumerable Sets and Degrees, , Springer Heidelberg
  • Terwijn, S., Zambella, D., Algorithmic randomness and lowness (2001) J. Symbolic Logic, 66, pp. 1199-1205

Citas:

---------- APA ----------
Figueira, S., Nies, A. & Stephan, F. (2006) . Lowness properties and approximations of the jump. Electronic Notes in Theoretical Computer Science, 143(SPEC ISS), 45-57.
http://dx.doi.org/10.1016/j.entcs.2005.05.025
---------- CHICAGO ----------
Figueira, S., Nies, A., Stephan, F. "Lowness properties and approximations of the jump" . Electronic Notes in Theoretical Computer Science 143, no. SPEC ISS (2006) : 45-57.
http://dx.doi.org/10.1016/j.entcs.2005.05.025
---------- MLA ----------
Figueira, S., Nies, A., Stephan, F. "Lowness properties and approximations of the jump" . Electronic Notes in Theoretical Computer Science, vol. 143, no. SPEC ISS, 2006, pp. 45-57.
http://dx.doi.org/10.1016/j.entcs.2005.05.025
---------- VANCOUVER ----------
Figueira, S., Nies, A., Stephan, F. Lowness properties and approximations of the jump. Electron. Notes Theor. Comput. Sci. 2006;143(SPEC ISS):45-57.
http://dx.doi.org/10.1016/j.entcs.2005.05.025