scientific article
Publication:3757904
zbMath0621.03026MaRDI QIDQ3757904
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computable functionspolynomial timedeterministic timeexponential timenumber-theoretic functioncut free Gentzen proofsKalmar elementarymany-sorted arithmeticnon-deterministic timenormalized formal proofsprovably recursive
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Complexity of proofs (03F20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65) Hierarchies of computability and definability (03D55)
Related Items