Three aspects of super-recursive algorithms and hypercomputation or finding black swans

被引：22

作者：

Burgin, M ^{[1
]}

Klinger, A ^{[1
]}

机构：

[1] Univ Calif Los Angeles, Dept Comp Sci, Los Angeles, CA 90095 USA

来源：

关键词：

D O I：

10.1016/j.tcs.2003.12.001

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：1 / 11

页数：11

共 15 条

[1] [Anonymous], 1950, The American Mathematical Monthly, DOI DOI 10.1080/00029890.1950.11999523
[2] ASIMOV I, 1959, WORDS SCI HIST THEM
[3] How we know what technology can do
Burgin, M
[J]. COMMUNICATIONS OF THE ACM, 2001, 44 (11) : 82 - 88
[4] NEOCLASSICAL ANALYSIS - FUZZY CONTINUITY AND CONVERGENCE
BURGIN, M
[J]. FUZZY SETS AND SYSTEMS, 1995, 75 (03) : 291 - 299
[5] BURGIN M, 1985, PROGRAMMING, V4, P3
[6] BURGIN MS, 1992, DOKL AKAD NAUK+, V325, P654
[7] Machines, logic and quantum physics
Deutsch, D
Ekert, A
Lupacchini, R
[J]. BULLETIN OF SYMBOLIC LOGIC, 2000, 6 (03) : 265 - 283
[8] GLEICK James, 1989, CHAOS MAKING NEW SCI
[9] Gold E. M., 1965, J. Symb. Log, V30, P28, DOI 10.2307/2270580
[10] Infinite time Turing machines
Hamkins, JD
Lewis, A
[J]. JOURNAL OF SYMBOLIC LOGIC, 2000, 65 (02) : 567 - 604