It's time to think outside the computational box

@article{Kugel2005ItsTT,
  title={It's time to think outside the computational box},
  author={P. Kugel},
  journal={Commun. ACM},
  year={2005},
  volume={48},
  pages={32-37}
}
  • P. Kugel
  • Published 2005
  • Computer Science
  • Commun. ACM
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. 

Figures from this paper

You Don't Need a Hypercomputer to Evaluate an Uncomputable Function
  • P. Kugel
  • Mathematics, Computer Science
  • Int. J. Unconv. Comput.
  • 2009
I believe the human mind can evaluate functions so uncomputable that no machine, not even a hypercomputer, can compute them. But I believe that computers can evaluate such functions too, becauseExpand
SUPER-RECURSIVE FEATURES OF EVOLUTIONARY PROCESSES AND THE MODELS FOR COMPUTATIONAL EVOLUTION
TLDR
The model of evolutionary computer discussed here is the one the authors need to do experiments that specifically test for essential questions related to computational evolution and that could possibly lead to exploitation of physical ideas about the nature of evolution. Expand
Incrementally Inferring Context-Free Grammars for Domain-Specific Languages
TLDR
A new application area for grammar inference is proposed which intends to make domain-specific language development easier and finds a second application in renovation tools for legacy software systems. Expand
The development of computer science: a sociocultural perspective
  • M. Tedre
  • Sociology, Computer Science
  • Baltic Sea '06
  • 2006
TLDR
It is argued that understanding of how computer science works is an important part of the knowledge of an educated computer scientist. Expand
Techniques for Context-Free Grammar Induction and Applications: Application of novel inference algorithms to software maintenance problems
TLDR
This book provides an overview of the area and discusses the following applications of grammar inference: recovery of a metamodel from instance models: the MetAmodel Recovery System (MARS) and GenInc, an unsupervised incremental CFG learning algorithm that allows further progress towards inferring DSLs and finds a second application in recovery of legacy DSLs. Expand
AN UNSUPERVISED INCREMENTAL LEARNING ALGORITHM FOR DOMAIN-SPECIFIC LANGUAGE DEVELOPMENT
TLDR
Extensions to the inference capabilities of GenInc, an incremental learning algorithm for inferring CFGs are discussed, it is shown that these extensions enable GenInc to infer more comprehensive grammars, and the results are discussed. Expand
GenInc: An Incremental Context-Free Grammar Learning Algorithm for Domain-Specific Language Development
TLDR
Improvements made to an incremental learning algorithm, called GenInc, for inferring context-free grammars with a core focus on facilitating domain-specific language development are discussed. Expand
Applications of wireless visual sensor networks : the digital zoo
In this chapter we will describe our work to set up a large scale wireless visual sensor network in a Swedish zoo. It is located close to the Arctic Circle making the environment very hard for thisExpand
Ontology-based models in pervasive computing systems
TLDR
This work identifies a number of deficiencies that must be addressed in order to apply the ontological techniques successfully to next-generation pervasive systems. Expand
A Complete Bibliography of Publications in Communications of the ACM : 2020–2029
A* [11]. Above [53]. abuse [120]. accelerators [157]. access [120]. accessibility [133]. achieve [21]. ACM [103, 74, 96, 99]. Across [45, 84]. adapting [96]. Adding [64]. address [151]. adoptionExpand
...
1
2
...

References

SHOWING 1-10 OF 15 REFERENCES
Toward a theory of intelligence
  • P. Kugel
  • Computer Science
  • Theor. Comput. Sci.
  • 2004
TLDR
This paper wants to explore Turing's suggestion by asking what it is, beyond computation, that intelligence might require, why it might require it and what knowing the answers to the first two questions might do to help us understand artificial and natural intelligence. Expand
Computing Machines Can't Be Intelligent (...and Turing Said So)
  • P. Kugel
  • Computer Science
  • Minds and Machines
  • 2004
TLDR
The author explains how giving computers more ``initiative'' can allow them to do more than compute and says why he believes and believes that Turing believed that they will have to go beyond computation before they can become genuinely intelligent. Expand
Induction, Pure and Simple
  • P. Kugel
  • Computer Science
  • Inf. Control.
  • 1977
TLDR
This paper focuses on pure induction in which the conclusions “go beyond the information given” in the premises from which they are derived and on simple induction, which is rather a stark kind of induction that deals with computable predicates on the integers in rather straightforward ways. Expand
On Computable Numbers, with an Application to the Entscheidungsproblem
1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable sequences and numbers. 3. Examples of computing machines. 4. AbbreviatedExpand
The Logic of Scientific Discovery.
Lecture to the London Mathematical Society on 20 Febru- ary 1947
  • In A.M. Turing’s ACE Report and Other Papers,
  • 1986
Intelligence requires more than computing ... and Turing said so
  • Minds and Machines
  • 2002
Neurotechnique: Pure and simple
  • H. Wood
  • Physics
  • Nature Reviews Neuroscience
  • 2002
...
1
2
...