On quasi-universal word functions

DOI10.3103/S0278641916010040zbMath1339.03032MaRDI QIDQ290002

K. V. Osipov

Publication date: 1 June 2016

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

quasi-universal functionword functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (2)

Operation of bound prefix concatenation and finite superposition bases ⋮ On the operations of bounded suffix summation and multiplication

Cites Work

• Elimination of recursion schemas in the Grzegorczyk \(\mathcal{E}^2\) class
• An example of a simple quasi-universal function in the class ε 2 of the Grzegorczyk hierarchy
• ÜBER DIE ELIMINIERBARKEIT VON DEFINITIONSSCHEMATA IN DER THEORIE DER REKURSIVEN FUNKTIONEN
• Unnamed Item

This page was built for publication: On quasi-universal word functions