scientific article
From MaRDI portal
Publication:3979266
zbMath0743.03030MaRDI QIDQ3979266
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Higher-type and set recursion theory (03D65)
Related Items (4)
Computational Complexity Via Finite Types ⋮ Recursion in Higher Types and Resource Bounded Turing Machines ⋮ Characterizing complexity classes by higher type primitive recursive definitions ⋮ Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)
This page was built for publication:
