56 SCIENTIFIC AMERICAN JANUARY 2005 ed, they not only work less efficiently but also
make more mistakes.“It seems to add cumulatively to a feeling of frustration,” Picard reports …

“Hypercomputation” is often defined as transcending Turing computation in the sense of
computing a larger class of functions than can Turing machines. While this possibility is …

Ubiquity symposium: Computation and Computational Thinking Page 1 Ubiquity, an ACM
publication January, 2011 http://ubiquity.acm.org 1 ©2011 Association for Computing Machinery …

Hypercomputation: Hype or Computation? Page 1 COMMUNICATIONS OF THE ACM August
2002/Vol. 45, No. 8 23 In 1936, Alan Turing laid the theoretical groundwork for modern …

COMPUTER SCIENCE: THE EMERGENCE OF A DISCIPLINE Page 1 TURING AWARD
LECTURE COMPUTER SCIENCE: THE EMERGENCE OF A DISCIPLINE The continued rapid …

An understanding of emergent computation requires a profound revision of the most
fundamental ideas. A noticeable attempt of such a rethinking is a world view in which natural …

It is shown that the concept of a Universal Computer cannot be realized. Specifically,
instances of a computable function F are exhibited that cannot be computed on any machine …

Computational complexity is one of the most beautiful fields of modern mathematics, and it is
increasingly relevant to other sciences ranging from physics to biology. But this beauty is …

This book is an introduction, on the undergraduate level, to the classical and contemporary
theor y of computation. The topics covered are, in a few words, the theory of automata and …