Finite alogorithmic procedures and computation theories.
Mathematica Scandinavica, Tome 46 (1980), pp. 77-94
Mots-clés :
recursion-theoretic properties of computable functions, computation theories, register machines, relational system, finite algorithmic procedures, partial recursive functions
@article{MS2_1980__46_166691,
author = {J. Moldestad and V. Stoltenberg-Hansen},
title = {Finite alogorithmic procedures and computation theories.},
journal = {Mathematica Scandinavica},
pages = {77--94},
year = {1980},
volume = {46},
zbl = {0419.68078},
url = {http://geodesic.mathdoc.fr/item/MS2_1980__46_166691/}
}
J. Moldestad; V. Stoltenberg-Hansen. Finite alogorithmic procedures and computation theories.. Mathematica Scandinavica, Tome 46 (1980), pp. 77-94. http://geodesic.mathdoc.fr/item/MS2_1980__46_166691/