Helping and the meet of pairs of honest subrecursive classes

DOI10.1016/S0019-9958(75)90248-XzbMath0301.68057MaRDI QIDQ4055194

Michael Machtey

Publication date: 1975

Published in: Information and Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items

A maximal sequence of classes transformable by primitive recursion in a given class, Polynomial and abstract subrecursive classes, Relativization of the Theory of Computational Complexity