SCOPUS 정보 검색 플랫폼

Volumn 271, Issue 1-2, 2002, Pages 3-14

A characterization of c.e. random reals

Author keywords

c.e. Real; Chaitin real; Random real

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; PROBABILITY; THEOREM PROVING; TURING MACHINES;

RANDOM REALS;

RANDOM PROCESSES;

EID: 0037185197 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(01)00027-5 Document Type: Article

Times cited : (29)

References (17)

2
- 0033595272
- Randomness everywhere
- (1999) Nature , vol.400 , pp. 319-320
- Calude, C.S.¹ Chaitin, G.J.²

3
- 0006893032
- Program-size complexity of initial segments and domination relation reducibility
- J. Karhumäki, H.A. Maurer, G. Pǎun, G. Rozenberg (EDs.), Springer, Berlin
- (1999) Jewels are Forever , pp. 225-237
- Calude, C.S.¹ Coles, R.J.²

4
- 0000109403
- Kraft-Chaitin inequality revisited
- (1996) J. Univ. Comput. Sci. , vol.5 , pp. 306-310
- Calude, C.¹ Grozea, C.²

5
- 78649893518
- Recursively enumerable reals and Chaitin Ω numbers
- M. Morvan, C. Meinel, D. Krob (Eds.), Proc. 15th Symp. on Theoretical Aspects of Computer Science, Paris, Springer, Berlin, Full paper to appear
- (1998) Theoret. Comput. Sci. , pp. 596-606
- Calude, C.S.¹ Hertling, P.² Khoussainov, B.³ Wang, Y.⁴

6
- 0002429893
- Randomness as an invariant for number representations
- H. Maurer, J. Karhumäki, G. Rozenberg (Eds.), Springer, Berlin
- (1994) Results and Trends in Theoretical Computer Science , pp. 44-66
- Calude, C.¹ Jürgensen, H.²

7
- 33751505024
- Chaitin Ω numbers and strong reducibilities
- (1997) J. Univ. Comput. Sci. , vol.3 , pp. 1161-1166
- Calude, C.¹ Nies, A.²

8
- 0016532771
- A theory of program size formally identical to information theory
- Reprinted in: [10], pp. 113-128
- (1975) J. Assoc. Comput. Mach. , vol.22 , pp. 329-340
- Chaitin, G.J.¹

9
- 0000303535
- Algorithmic information theory
- 496, Reprinted in: [10], pp. 44-58
- (1977) IBM J. Res. Develop. , vol.21 , pp. 350-359
- Chaitin, G.J.¹

11
- 0004287895
- Springer, Singapore
- (1997) The Limits of Mathematics
- Chaitin, G.J.¹

13
- 0001592810
- Numbers defined by Turing machines
- Springer, Wien
- (1996) Annals of the Kurt-Gödel-Society, Collegium Logicum , vol.2 , pp. 118-137
- Freund, R.¹ Staiger, L.²

14
- 18344371384
- The definition of random sequences
- (1966) Inform. Control , vol.9 , pp. 602-619
- Martin-Löf, P.¹

15
- 0006893236
- Random implies Ω-like, manuscript
- 14 December, Full paper, Randomness and recursive enumerability, to appear in
- (1988) SIAM J. Comput. , pp. 2
- Slaman, T.A.¹

16
- 0003412510
- Recursively Enumerable Sets and Degrees
- Springer, Berlin
- (1987)
- Soare, R.I.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.