scientific article; zbMATH DE number 3532936
From MaRDI portal
Publication:4109663
zbMath0342.02031MaRDI QIDQ4109663
Publication date: 1976
Full work available at URL: https://eudml.org/doc/70863
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Hierarchies of computability and definability (03D55)
Related Items (10)
Generalized computations with binary oracles ⋮ Some modifications of iterated Kleene calculability ⋮ Iterated Kleene computability ⋮ Generalized computations with oracles ⋮ Autonomous computability ⋮ Superautonomous numerations and projected ordinals ⋮ Effective oracles ⋮ Effective hierarchies ⋮ A method of modeling a classical second stage arithmetic ⋮ Computations with oracles
This page was built for publication:
