Hostname: page-component-8448b6f56d-m8qmq Total loading time: 0 Render date: 2024-04-24T14:54:37.611Z Has data issue: false hasContentIssue false
  • English
  • Français

A reduction theorem for normal algorithms1

Published online by Cambridge University Press:  12 March 2014

J. W. Swanson
J. W. Swanson*
Affiliation:
University of Massachusetts
Get access Rights & Permissions [Opens in a new window]

Extract

Markov's [2] notion of Normal Algorithm (NA), with which we assume familiarity, is the simplest of the better known ways of expressing the concept of algorithmicity. An NA consists of an ordered finite list of replacement formulae

The dots in parentheses indicate that a given replacement formula may be either simple (P → Q), or terminal (P → .Q). No restrictions are imposed on the lengths of the Pi and Qi in the replacement formulae, and the only rule of order of application is a priority rule to the effect that of several replacement formulae applicable to a word W at a given step, the earliest one is used.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 31 , Issue 1 , March 1966 , pp. 86 - 97
Copyright
Copyright © Association for Symbolic Logic 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

1

The author wishes to express his gratitude to Professor Haskell B. Curry for his helpful criticism of an earlier draft of this paper.

References

[1]Curry, H. B., Foundations of mathematical logic, McGraw Hill, 1963.Google Scholar
[2]Markov, A. A., Theory of algorithms, Trudy matématičéskogo Instituta imèni Stéklova, V. A. (Translation: Office of Technical Services, U. S. Department of Commerce, Washington, D. C., 1961).Google Scholar
[3]Mendelson, E., Introduction to mathematical logic, D. Van Nostrana, 1964.Google Scholar
[4]Mo, Shao-Kui, Notes on mathematical logic, Chinese mathematics, vol. 4, No. 4 (1963) pp. 527–552. (Translation of Acta Mathematica Sinica, vol. 13, No. 4 (1963) pp. 485–507.)Google Scholar
[5]Nagornyj, N. M., Some generalizations of the concept of normal algorithms, Trudy matématičéskogo Instituta imèni Stéklova, V. A., Vol. 52, Izdatél'stovo Akademii Nauk SSSR (1958), Moscow and Leningrad, pp. 7–65.Google Scholar
[6]Nagoryj, N. M., Towards strengthening of the reduction theorem of the theory of algorithms, Doklady Akadémi Nauk SSSR, vol. 90 (1953), pp. 341–342.Google Scholar
[7]Železnikar, A. P., Some algorithm theory and its applicability, Glasnik Matematičko-fizički i Astronomiski. Drustvo Matematičara i Fisičara N. R. Hrvatske. Serija II, 18 (1963), pp. 141–158.Google Scholar