Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Boolos, G.S. and Jeffrey, R. C. (1989), Computability and Logic, Cambridge: Cambridge University Press.
Bringsjord, S. (1992), What Robots Can and Can't Be, Dordrecht: Kluwer Academic Publishers.
Bringsjord, S. (1994), 'Computation, Among Other Things, Is Beneath Us', Minds and Machines 4, pp. 469–488.
Bringsjord, S. (1998), 'Philosophy and 'super' Computation', in J. Moor and T. Bynam, eds., The Digital Phoenix: How Computers are Changing Philosopy, Oxford: Blackwell, pp. 231–252.
Bringsjord, S. (2001), 'In Computation, Parallel Is Nothing, Physical Everything', Minds and Machines 11, pp. 95–99.
Bringsjord, S. and Ferrucci, D. (2000), Artificial Intelligence and Literary Creativity: Inside the Mind of Brutus, a Storytelling Machine, Mahwah, NJ: Lawrence Erlbaum.
Brooks, M. (1999), Quantum Computing and Communications, Berlin: Springer.
Cleland, C. (1995), 'Effective procedures and computable functions', Minds and Machines 5, pp. 9–23.
Cleland, C. (2000), 'Effective Procedures and Casual Processes', Hypercomputation Workshop, London, England, May 24, 2000.
Cleland, C (2001), 'Recipes, Algorithms, and Programs', Minds and Machines 11, pp. 219–237.
Copeland, B. J. (1998), 'Even Turing Machines Can Compute Uncomputable Functions', in J. Casti, ed., Unconventional Models of Computation, London: Springer, pp. 150–164.
Davis, M., Sigal, R. and Weyuker, E. (1994), Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science, New York, NY: Academic Press.
Deutsch, D. (1985), 'Quantum Theory, The Church-Turing Principle, and The Universal Quantum Computer', Proceedings of the Royal Society of London, Series A 400, pp. 87–117.
Ebbinghaus, H. D., Flum, J. and Thomas, W. (1984), Mathematical Logic, NewYork, NY: Springer.
Eicholz, R. E., O'Daffer, P. G., Charles, R. I., Young, S. I., Barnett, C. S., Clemens, S. R., Gilmer, G. F., Reeves, A., Renfro, F. L., Thompson, M. M. and Thorntoon, C. A. (1995), Ýit Grade 7 Addison-Wesley Mathematics, Reading, MA: Addison-Wesley.
Feltovich, P., Ford, K and Hayes, P., eds (1983), Proceedings of a Conference on Physics and Computation, International Journal of Theoretical Physics 21(3/4), 21(6/7), 21(12).
Feynman, R. (1986), 'Quantum Mechanical Computers', Foundations of Physics 16, pp. 507–531.
Feynman, R. P. (1982), 'Simulating Physics With Computers', International Journal of Theoretical Physics 21, pp. 467–488.
Ford, J. (1983), 'How Random Is a Coin Toss?', Physics Today, pp. 40–47.
Fredkin, E. (1990), 'Digital Mechanics', Physica D 45, pp. 20–32.
Gold, M. (1965), 'Limiting Recursion', Journal of Symbolic Logic 33(1), pp. 28–47.
Jacquette, D. (1994), Philosophy of Mind, Englewood Cliffs, NJ: Prentice-Hall.
Kugel, P. (1986), 'Thinking May Be More Than Computing', Cognition 18, pp. 128–149.
Lewis, H. and Papadimitriou, C. (1981), Elements of the Theory of Computatution, Englewood Cliffs, NJ: Prentice-Hall.
Pour-El, M. and Richards, I. (1981a), 'A Computable Ordinary Differential Equation Which Possesses No Computable Solution', Annals of Mathematical Logic 17, pp. 61–90.
Pour-El, M. and Richards, I. (1981b), 'The Wave Equation Computable Initial Data Such That Its Unique Solution Is Not Computable', Advances in Mathematics 39, pp. 215–239.
Putnam, H. (1965), 'Trial and Error Predicates and a Solution To a Problem of Mostowski', Journal of Symbolic Logic 30(1), pp. 49–57.
Russell, B. (1936), 'The Limits of Empiricism', Proceedings of the Aristotelian Society 36, pp. 131–150.
Salmon, W.C. (1975), Space, Time and Motion: A Philosophical Introduction, Encino, CA: Dickenson.
Schechter, E. (2001), 'Constructivism Is Difficult', Ýit the Mathematical Association of America Monthly 108, pp. 50–54.
Searle, J. (1992), The Rediscovery of the Mind, Cambridge, MA: MIT Press.
Siegelmann, H. (1995), 'Computation Beyond the Turning Limit', Science 268, pp. 545–548.
Siegelmann, H and Sontag, E. (1994), 'Analog Computation Via Neural Nets', Theoretical Computer Science 131, pp. 331–360.
Teller, P. (1989), Relativity, Relation Holism, and The Bell Inequalities, in J. Cushing and E. McMullin, eds., 'Philosophical Consequences of Quantum Theory', Notre Dame, IN: University of Notre Dame Press.
Turing, A. (1938), Dissertation for the PhD: 'systems of Logic Based on Ordinals', Princeton, NJ: Princeton University.
Turing, A. (1939), 'Systems of Logic Based on Ordinals', Proceedings of the London Mathematical Society (Series 2) 45, pp. 161–228.
Weyl, H. (1949), Philosophy of Mathematics and Natural Science, Princeton, NJ: Princeton University Press.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bringsjord, S., Zenzen, M. Toward a Formal Philosophy of Hypercomputation. Minds and Machines 12, 241–258 (2002). https://doi.org/10.1023/A:1015651216328
Issue Date:
DOI: https://doi.org/10.1023/A:1015651216328