메뉴 건너뛰기
Theoretical Computer Science
Volumn 231, Issue 2, 2000, Pages 143-156
The Turing closure of an archimedean field
Author keywords

BSS model; Degree theory; Turing machines; Type 2 computability
Indexed keywords

EID: 0347997390     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00096-1     Document Type: Article
Times cited : (2)
References (17)
  • 1
    • 84968516134 scopus 로고
    • On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines
    • L. Blum, M. Shub, S. Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. (NS) 21 (1989) 1-46.
    • (1989) Bull. Amer. Math. Soc. (NS) , vol.21 , pp. 1-46
    • Blum, L.1    Shub, M.2    Smale, S.3
  • 2
    • 0040757848 scopus 로고    scopus 로고
    • δ-uniform BSS machines
    • P. Boldi, S. Vigna, δ-uniform BSS machines, J. Complexity 14 (2) (1998) 234-256.
    • (1998) J. Complexity , vol.14 , Issue.2 , pp. 234-256
    • Boldi, P.1    Vigna, S.2
  • 4
    • 0040684164 scopus 로고    scopus 로고
    • Feasible real random access machines
    • V. Brattka, P. Hertling, Feasible real random access machines, J. Complexity 14(4) (1998) 490-526.
    • (1998) J. Complexity , vol.14 , Issue.4 , pp. 490-526
    • Brattka, V.1    Hertling, P.2
  • 5
    • 0039547610 scopus 로고
    • On the convergence of Newton's method
    • J. Friedman, On the convergence of Newton's method, J. Complexity 5 (1989) 12-33.
    • (1989) J. Complexity , vol.5 , pp. 12-33
    • Friedman, J.1
  • 6
    • 0001247981 scopus 로고
    • Reducibilities on real numbers
    • K.-I Ko, Reducibilities on real numbers, Theoret. Comput. Sci. 31 (1984) 101-123.
    • (1984) Theoret. Comput. Sci. , vol.31 , pp. 101-123
    • Ko, K.-I.1
  • 8
    • 0010707241 scopus 로고
    • Countable initial segments of the degrees of unsolvability
    • A.H. Lachlan, R. Lebeuf, Countable initial segments of the degrees of unsolvability, J. Symbolic Logic 41 (1976) 289-300.
    • (1976) J. Symbolic Logic , vol.41 , pp. 289-300
    • Lachlan, A.H.1    Lebeuf, R.2
  • 9
    • 0003956970 scopus 로고
    • Addison-Wesley, Reading, MA
    • S. Lang, Algebra, Addison-Wesley, Reading, MA, 1971.
    • (1971) Algebra
    • Lang, S.1
  • 11
    • 0000645113 scopus 로고
    • Recursion theory and Dedekind cuts
    • R.I. Soare, Recursion theory and Dedekind cuts, Trans. Amer. Math. Soc. 140 (1969) 271-294.
    • (1969) Trans. Amer. Math. Soc. , vol.140 , pp. 271-294
    • Soare, R.I.1
  • 12
    • 0001169015 scopus 로고
    • On degrees of recursive unsolvability
    • C. Spector, On degrees of recursive unsolvability, Ann. of Math. (2) 64 (1956) 581-592.
    • (1956) Ann. of Math. (2) , vol.64 , pp. 581-592
    • Spector, C.1
  • 13
    • 84960561455 scopus 로고    scopus 로고
    • On computable numbers with an application to the Entscheidungsproblem
    • A.M. Turing, On computable numbers with an application to the Entscheidungsproblem, Proc. London Math. Soc. (3) 42 (1936) 230-265. A correction, 43, 544-546.
    • (1936) Proc. London Math. Soc. (3) , vol.42 , pp. 230-265
    • Turing, A.M.1
  • 14
    • 84960561455 scopus 로고    scopus 로고
    • A.M. Turing, On computable numbers with an application to the Entscheidungsproblem, Proc. London Math. Soc. (3) 42 (1936) 230-265. A correction, 43, 544-546.
    • A Correction , vol.43 , pp. 544-546
  • 16

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