메뉴 건너뛰기




Volumn 12, Issue 2, 2002, Pages 259-280

Logically possible machines

Author keywords

Convergence; Fixed point; Infinite algorithm; Infinite machine; Infinite mind; Limit; Possible world; Situation; Super Turing computer

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; FORMAL LOGIC; SET THEORY; SUPERCOMPUTERS;

EID: 0036577340     PISSN: 09246495     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1015603317236     Document Type: Article
Times cited : (9)

References (52)
  • 5
    • 0000622662 scopus 로고    scopus 로고
    • Does a rock implement every finite-state automation?
    • (1996) Synthese , vol.108 , pp. 309-333
    • Chalmers, D.1
  • 18
    • 77956947880 scopus 로고
    • Church's thesis and principles for mechanisms
    • in J. Barwise, H. Keisler and K. Kunen, eds.; New York: North-Holland
    • (1980) The Kleene Symposium , pp. 123-148
    • Gandy, R.1
  • 39
    • 0009707880 scopus 로고
    • Causal connections
    • in J. Kim and E. Sosa, eds.; Malden, MA: Blackwell
    • (1984) Metaphysics , pp. 444-457
    • Salmon, W.1


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