×

“Helping”: Several formalizations. (English) Zbl 0342.02025


MSC:

03D20 Recursive functions and relations, subrecursive hierarchies
68Q25 Analysis of algorithms and problem complexity
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Complexity of computer computations (1972)
[2] complexity of Presburger arithmetic (1974) · Zbl 0319.68024
[3] Conference Record of the Third Annual ACM Symposium on Theory of Computing pp 151– (1971)
[4] DOI: 10.1145/321386.321395 · Zbl 0155.01503 · doi:10.1145/321386.321395
[5] Transactions of the American Mathematical Society
[6] DOI: 10.1145/1008293.1008294 · doi:10.1145/1008293.1008294
[7] Theory of recursive functions and effective computability (1967) · Zbl 0183.01401
[8] Computational speed-up by effective operators 37 pp 55– (1972)
[9] Purdue University Technical Report 82
[10] Zeitschrift für Logik und mathematische Grundlagenforschung (1975)
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.