Hostname: page-component-8448b6f56d-t5pn6 Total loading time: 0 Render date: 2024-04-18T04:58:03.291Z Has data issue: false hasContentIssue false
  • English
  • Français

There is no SW-complete c.e. real

Published online by Cambridge University Press:  12 March 2014

Liang Yu  and
Decheng Ding
Liang Yu
Affiliation:
Department of Mathematics, Nanjing University, Nanjing, Jiang SU, China, E-mail: yuliang@mcs.vuw.ac.nz
Decheng Ding
Affiliation:
Department of Mathematics, Nanjing University, Nanjing, Jiang SU, China, E-mail: dcding@nju.edu.cn
Get access Rights & Permissions [Opens in a new window]

Abstract.

We prove that there is no sw-complete c.e. real, negatively answering a question in [6].

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 69 , Issue 4 , December 2004 , pp. 1163 - 1170
Copyright
Copyright © Association for Symbolic Logic 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Calude, Christian S., Hertling, Peter, Khoussainov, Bakhadyr, and Wang, Yongge, Recursively enumerable reals and Chaitin's Ω number, Stacs ’98 (Morvan, M., Meinel, C., and Krob, D., editors). Lecture Notes in Computer Science, vol. 1373. Springer, 1998, pp. 596–606.Google Scholar
[2]Chaitin, Gregory J., A theory of program size formally identical to information theory, Journal of the Association for Computing Machinery, vol. 13 (1966), pp. 547–569.Google Scholar
[3]Chaitin, Gregory J., Algorithmic information theory, Cambridge University Press, Cambridge, 1987.CrossRefGoogle Scholar
[4]Chaitin, Gregory J., Incompleteness theorems for random reals, Advances in Applied Mathematics, vol. 8 (1987). pp. 119–146.CrossRefGoogle Scholar
[5]Downey, Rodney G. and Hirschfeldt, Denis R., Algorithmic randomness and complexity, Monographs in Computer Science. Springer-Verlag.Google Scholar
[6]Downey, Rodney G., Hirschfeldt, Denis R., and LaForte, Geoff, Randomness and reducibility, Journal of Computer and System Sciences, vol. 68 (2004), pp. 96–114.CrossRefGoogle Scholar
[7]Kolmogorov, A. N., Three approaches to the quantitative definition of information, Problems of Information Transmission (Problemy Peredachi Informatsü), vol. 1 (1965), pp. 1–7.Google Scholar
[8]Antonin Kučera and Theodore A. Slaman, Randomness and recursive enumerability, SIAM Journal on Computing, vol. 31 (2001), pp. 199–211.Google Scholar
[9]Li, Ming and Vitányi, Paul, An introduction to Kolmogorov complexity and its applications, second ed., Graduate Texts in Computer Science, Springer-Verlag, New York, 1997.CrossRefGoogle Scholar
[10]Martin-Löf, P., The definition of random sequences, Information and Control, vol. 9 (1966), pp. 602–619.CrossRefGoogle Scholar
[11]Schnorr, C. P., Zufälligkeit und Wahrscheinlichkeit, Lecture Notes in Mathematics, vol. 218. Springer-Verlag. New York, 1971.CrossRefGoogle Scholar
[12]Soare, Robert I., Recursion theory and Dedekind cuts, Transactions of the American Mathematical Society, vol. 140 (1969), pp. 271–294.Google Scholar
[13]Soare, Robert I., Recursively enumerable sets and degrees, Springer-Verlag, Heidelberg, 1987.CrossRefGoogle Scholar
[14]Solomonoff, R., A formal theory of inductive inference, part 1 and part 2, Information and Control, vol. 7 (1964), pp. 224–254.Google Scholar