New Computational Paradigms
From MaRDI portal
Publication:5717048
DOI10.1007/b136981zbMath1118.03030OpenAlexW2278484831MaRDI QIDQ5717048
Lars Kristiansen, Mathias Barra
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136981
rudimentary relationscomplexity classesfragments of typed \(\lambda\)-calculusimplicit characterisationssmall relational Grzegorczyk classes
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20) Combinatory logic and lambda calculus (03B40)
Related Items (5)
A Characterisation of the Relations Definable in Presburger Arithmetic ⋮ Pure Iteration and Periodicity ⋮ Recursion in Higher Types and Resource Bounded Turing Machines ⋮ Non-determinism in Gödel's system \(T\) ⋮ Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)
This page was built for publication: New Computational Paradigms
