SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Complexity

Volumn 16, Issue 4, 2000, Pages 676-690

Weakly Computable Real Numbers

(3) Ambos Spies, Klaus a Weihrauch, Klaus b Zheng, Xizhong c

a UNIVERSITY OF HEIDELBERG (Germany)

b UNIVERSITY OF HAGEN (Germany)

c BRANDENBURG UNIVERSITY OF TECHNOLOGY (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003143720 PISSN: 0885064X EISSN: None Source Type: Journal
DOI: 10.1006/jcom.2000.0561 Document Type: Article

Times cited : (58)

References (16)

1
- 85050902625
- 2-Mengen
- 2-Mengen. Arch. Math. Logik. 18:1976;55-65.
- (1976) Arch. Math. Logik , vol.18 , pp. 55-65
- Carstens, H.G.¹

2
- 78649893518
- Recursively enumerable reals and Chaintin's Ω-number
- C. Calude, P. Hertling, B. Khoussainov, and Y. Wang, Recursively enumerable reals and Chaintin's Ω-number, in STACS'98, pp. 596-606.
- In STACS'98 , pp. 596-606
- Calude, C.¹ Hertling, P.² Khoussainov, B.³ Wang, Y.⁴

3
- 0000702396
- A pseudofundamental sequence that is not equivalent to a monotone one (Russian)
- Ceitin G. S. A pseudofundamental sequence that is not equivalent to a monotone one (Russian). Zap. Naučn. Sem. Leningrad. Otdel. Mat. Inst. Steklov (LOMI). 20:1971;263-271.
- (1971) Zap. Naučn. Sem. Leningrad. Otdel. Mat. Inst. Steklov (LOMI) , vol.20 , pp. 263-271
- Ceitin, G.S.¹

4
- 0004017467
- Leicester: Leicester University
- Cooper S. B. Degrees of Unsolvability. 1971;Leicester University, Leicester.
- (1971) Degrees of Unsolvability
- Cooper, S.B.¹

5
- 0002560015
- On a hierarchy of sets I; II and III
- Ershov Y. On a hierarchy of sets I; II and III. Algebra i Logika. 7:1968;47-73.
- (1968) Algebra I Logika , vol.7 , pp. 47-73
- Ershov, Y.¹

6
- 0000573502
- Three theorems on recursive enumeration: I. Decomposition, II. Maximal sets, III. Enumeration without duplication
- Friedberg R. M. Three theorems on recursive enumeration: I. Decomposition, II. Maximal sets, III. Enumeration without duplication. J. Symbolic Logic. 23:1959;309-316.
- (1959) J. Symbolic Logic , vol.23 , pp. 309-316
- Friedberg, R.M.¹

7
- 0000313877
- Semirecursive sets and positive reducibility
- Jockusch C. G. Jr. Semirecursive sets and positive reducibility. Trans. Amer. Math. Soc. 131:1968;420-436.
- (1968) Trans. Amer. Math. Soc. , vol.131 , pp. 420-436
- Jockusch C.G., Jr.¹

8
- 0001799236
- On the definitions of some complexity classes of real numbers
- Ko Ker-I. On the definitions of some complexity classes of real numbers. Math. Systems Theory. 16:1983;95-100.
- (1983) Math. Systems Theory , vol.16 , pp. 95-100
- Ko, K.-I.¹

9
- 0001917363
- Recursive real numbers
- Lachlan A. H. Recursive real numbers. J. Symbolic Logic. 28:1950;1-16.
- (1950) J. Symbolic Logic , vol.28 , pp. 1-16
- Lachlan, A.H.¹

10
- 0001531051
- Recursive real numbers
- Rice H. G. Recursive real numbers. Proc. Amer. Math. Soc. 5:1954;784-791.
- (1954) Proc. Amer. Math. Soc. , vol.5 , pp. 784-791
- Rice, H.G.¹

11
- 0001398401
- Review of "r. Peter: 'Rekursive Funktionen,' Akad. Kiado. Budapest, 1951"
- Robinson R. M. Review of "R. Peter: 'Rekursive Funktionen,' Akad. Kiado. Budapest, 1951" J. Symbolic Logic. 16:1951;280.
- (1951) J. Symbolic Logic , vol.16 , pp. 280
- Robinson, R.M.¹

12
- 0004138172
- New York: McGraw-Hill. p. 644-653
- Rogers H. Jr. Theory of Recursive Functions and Effective Computability. 1967;McGraw-Hill, New York. p. 644-653.
- (1967) Theory of Recursive Functions and Effective Computability
- Rogers H., Jr.¹

13
- 0003412510
- Berlin/Heidelberg: Springer-Verlag
- Soare R. Recursively Enumerable Sets and Degrees. 1987;Springer-Verlag, Berlin/Heidelberg.
- (1987) Recursively Enumerable Sets and Degrees
- Soare, R.¹

14
- 84972500791
- Cohesive sets and recursively enumerable Dedekind cuts
- Soare R. Cohesive sets and recursively enumerable Dedekind cuts. Pacific J. Math. 31:1969;215-231.
- (1969) Pacific J. Math. , vol.31 , pp. 215-231
- Soare, R.¹

15
- 0000468030
- Nicht konstruktiv beweisbare Sätze der Analysis
- Specker E. Nicht konstruktiv beweisbare Sätze der Analysis. J. Symbolic Logic. 14:1949;145-158.
- (1949) J. Symbolic Logic , vol.14 , pp. 145-158
- Specker, E.¹

16
- 0003546966
- Computable Analysis, An Introduction
- Berlin: Springer-Verlag
- Weihrauch K. Computable Analysis, An Introduction. Texts in Theoretical Computer Science. An EATCS Series. 2000;Springer-Verlag, Berlin.
- (2000) Texts in Theoretical Computer Science. An EATCS Series
- Weihrauch, K.¹

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