Abstract
We will talk about a class of function defined on subsets of the set of nonnegative integers, and assuming nonnegative integer values: the so-called “computable functions”. We define a function to be computable if there exists an “effective description” for it, that is a finite sentence unambiguously indicating (possibly only some explicit way) what is its “behaviour” in correspondence to each natural number. In other words, an effective description must allow us to deduce, for any given argument, whether the described function is defined on it and, if it is so, the value it assumes there. Perhaps the careful reader will observe that this definition is very different from the one usually found in the literature: in fact, it may seem strange to call “computable” those functions for which we didn’t explicitly prescribe the precise means for computing them, for example, some particular procedure or model of an abstract “computing device”. Moreover, even the general concepts of “effective procedure”, “algorithm”, or “abstract computing device” are not needed for the definition we gave of a computable function.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
ARBIB, M., Theories of Abstract Automata, Prentice-Hall, Engelwood Cliffs, NY, 1969.
CHOMSKY, N.,“On Certain Formal Properties of Grammars”, Inf. and Control, 2.2 (1959), pp 137–167.
CHOMSKY, N., “Formal Properties of Grammars”, Handbook of Math Psych, 2, (1963), Wiley, New York, pp 323–418.
CHURCH, A., “An Unsolvable Problem of Elementary Number Theory”, American Journal of Mathematics.
CURRY, H., and R. FEYS, “Combinatory Logic, Vol. 1” North Holland, Amsterdam, 1968.
DAVIS, M., “Computability and Unsolvability”, McGraw-Hill, New York, 1958.
DAVIS, M., “The Undecidable”, Raven Press, Hawlett, 1965. 8.
HOPCROFT, J., and ULLMANN, J., “Formal Languages and Their Relation to Automata”, Addison-Wesley, Reading, 1969.
KLEENE, S., “General Recursive Functions of Natural Numbers”, Mathematische Aunalen, Vol. 112, (1936), pp 727–742.
KLEENE, S., “Introduction to Metamathematics” Van Nostrand, Princeton NY, 1952.
MARKOV, A., “The Theory of Algorithms” (Russian), Trudy Mathematicheskogo Instituta, imeni V.A. Steklova, vol. 38 (1951), pp 176–189; Engl. transi., Jerusalem, 1962.
MINSKY, M., “Computation: “Finite and Infinitc Machines”, Prentice-Hall, Englewood Cliffs, NY, 1967.
POST, E., “Finite Combinatory Processes-Formulation”, I, “The Journal of Symbolic Logic” Vol. I, (1936), pp 103–105.
RABIN, M., and SCOTT, D., “Finite Automata and Their Decision Problems”, IBM Journal of Research and Development, Vol. 3, (1959), pp 114–125.
ROGERS, H., Jr.: “Theory of Recursive Functions and Effective Computability”, McGraw-Hill, New York, 1967.
SALOMAA, A., “Theory of Automata”, Pergamon Press, Oxford, 1968
SCOTT, D., “The Lattice of Flow Diagrams”, in E. Engeler (ed.), “Symposium on Semantics of Algorithmic Languages”, Lecture Notes in Mathematics No. 168, Springer-Verlag, Wien, 1971.
TURING, A. “On Computable Numbers, with an Application to the Entscheidungsproblem”, Proceedings of the London Mathematical Society, ser$12, Vol. 42, (1936), pp 230–265; Vol. 43 (1936) pp 544–546.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Wien
About this chapter
Cite this chapter
Marzollo, A., Ukovich, W. (1976). An Introduction to Some Basic Concepts and Techniques in the Theory of Computable Functions. In: Marzollo, A. (eds) Topics in Artificial Intelligence. International Centre for Mechanical Sciences, vol 256. Springer, Vienna. https://doi.org/10.1007/978-3-7091-4358-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-7091-4358-2_2
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81466-6
Online ISBN: 978-3-7091-4358-2
eBook Packages: Springer Book Archive