Theoretical 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
  

Last update Sat May 18 17:40:44 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page