Computability and logic
The rediscovery of the mind
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Analog computation via neural networks
Theoretical Computer Science
What Robots Can and Can't Be
Elements of the Theory of Computation
Elements of the Theory of Computation
Artificial Intelligence and Literary Creativity: Inside the Mind of Brutus, a Storytelling Machine
Artificial Intelligence and Literary Creativity: Inside the Mind of Brutus, a Storytelling Machine
In Computation, Parallel is Nothing, Physical Everything
Minds and Machines
Recipes, Algorithms, and Programs
Minds and Machines
| Hi-index | 0.00 |
Does what guides a pastry chef stand on par, from the standpoint of contemporary computer science, with what guides a supercomputer? Did Betty Crocker, when telling us how to bake a cake, provide an effective procedure, in the sense of `effective' used in computer science? According to Cleland, the answer in both cases is ``Yes''. One consequence of Cleland's affirmative answer is supposed to be that hypercomputation is, to use her phrase, ``theoretically viable''. Unfortunately, though we applaud Cleland's ``gadfly philosophizing'' (as, in fact, seminal), we believe that unless such a modus operandi is married to formal philosophy, nothing conclusive will be produced (as evidenced by the problems plaguing Cleland's work that we uncover). Herein, we attempt to pull off not the complete marriage for hypercomputation, but perhaps at least the beginning of a courtship that others can subsequently help along.