It's time to think outside the computational box

Authors:
Peter Kugel
Affiliations:
Boston College, Chestnut Hill, MA and Harvard Institute for Learning in Retirement, Cambridge, MA
Venue:
Communications of the ACM
Year:
2005

Citing 4
Cited 1

Alan Turing

Alan Turing
Computing Machines Can't Be Intelligent (...and Turing Said So)

Minds and Machines
Super-Recursive Algorithms (Monographs in Computer Science)

Super-Recursive Algorithms (Monographs in Computer Science)
Toward a theory of intelligence

Theoretical Computer Science - Super-recursive algorithms and hypercomputation

AN UNSUPERVISED INCREMENTAL LEARNING ALGORITHM FOR DOMAIN-SPECIFIC LANGUAGE DEVELOPMENT

Applied Artificial Intelligence

Quantified Score

Hi-index	48.22

Visualization

Abstract

Systems that don't announce when they've reached their final results can `compute' the uncomputable, possibly allowing them to understand their users and generate their own programs from examples.