default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 317
Volume 317, Number 1-3, 4 June 2004
- Mark Burgin, Allen Klinger:
Three aspects of super-recursive algorithms and hypercomputation or finding black swans. 1-11 - Peter Kugel:
Toward a theory of intelligence. 13-30 - Mark Burgin:
Algorithmic complexity of recursive and inductive algorithms. 31-60 - Jirí Wiedermann
:
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines. 61-69 - Mark Burgin, Allen Klinger:
Experience, generations, and limits in machine learning. 71-91 - Tien D. Kieu:
Hypercomputation with quantum adiabatic processes. 93-104 - Oron Shagrir:
Super-tasks, accelerating Turing machines and uncomputability. 105-114 - Bruce J. MacLennan:
Natural computation and non-Turing models of computation. 115-145 - Manuel Lameiras Campagnolo:
Continuous-time computation with restricted integration capabilities. 147-165 - Selmer Bringsjord, Konstantine Arkoudas:
The modal argument for hypercomputing minds. 167-190 - Benjamin Wells:
Hypercomputation by definition. 191-207 - Carol E. Cleland:
The concept of computability. 209-225 - Kevin T. Kelly:
Uncomputability: the problem of induction internalized. 227-249 - B. Jack Copeland:
Hypercomputation: philosophical issues. 251-267
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-04 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
