×

zbMATH — the first resource for mathematics

Sequence-to-sequence recursiveness. (English) Zbl 0311.02047

MSC:
03D20 Recursive functions and relations, subrecursive hierarchies
03D99 Computability and recursion theory
68N01 General topics in the theory of software
18B20 Categories of machines, automata
Software:
ALGOL 60
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Eilenberg, S.; Eigot, C.C., Iteration and recursion, Proceedings of the nat. acad. of sci., 61, 378-379, (1968) · Zbl 0193.31001
[2] Eilenberg, S.; Elgot, C.C., Recursiveness, (1970), Academic Press New York · Zbl 0211.31101
[3] Germano, G.; Maggiolo-Schettini, A., Markov’s normal algorithms without concluding formulas: an application, () · Zbl 0283.68026
[4] Germano, G.; Maggiolo-Schettini, A., A characterization of partial recursive functions via sequence functions, Notices amer. math. soc., 19, 332, (1972) · Zbl 0242.02043
[5] Germano, G., A new theory of computability, (), 33-36
[6] Germano, G.; Maggiolo-Schettini, A., Quelques caracterisations des fonctions rĂ©cursives partielles, C.R. acad. sci. Paris, 276, 1325-1327, (1973), Ser. A · Zbl 0324.02025
[7] Germano, G.; Maggiolo-Schettini, A., Proving a compiler correct: a simple approach, J. comput. system sci., 10, 666-679, (1975) · Zbl 0304.68022
[8] Germano, G.; Maggiolo-Schettini, A., Loops in ALGOL 60 and in category theory, SIGACT news, 6, 21-23, (1974)
[9] Henkin, L.; Monk, J.D.; Tarski, A., Cylindric algebras, (1971), North-Holland Publishing Co Amsterdam · Zbl 0214.01302
[10] Mac Lane, S., Categories for the working mathematicians, (1971), Springer-Verlag New York · Zbl 0232.18001
[11] Naur, P., Revised report on the algorithmic language ALGOL 60, Comm. ACM, 6, 1-17, (1963) · Zbl 0109.35105
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.