scientific article; zbMATH DE number 1176133
From MaRDI portal
Publication:4398473
zbMath0906.03040MaRDI QIDQ4398473
Publication date: 4 February 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)
Related Items (12)
Generalized notions of mind change complexity ⋮ Power set recursion ⋮ Effective forcing versus proper forcing ⋮ From the weak to the strong existence property ⋮ Learning by switching type of information. ⋮ The analytical completeness of Dzhaparidze's polymodal logics ⋮ Achilles and the tortoise climbing up the arithmetical hierarchy ⋮ Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data ⋮ Characterizing the interpretation of set theory in Martin-Löf type theory ⋮ Hyper-polynomial hierarchies and the polynomial jump ⋮ Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems ⋮ Post's problem for ordinal register machines: an explicit approach
This page was built for publication:
