scientific article; zbMATH DE number 3790417

MaRDI QIDQ3967527zbMATH OpenFDO

Authors Stefano Stefani

Publication date 1982

zbMATH Keywords

diagonal phenomenadifficulty degreesLebesgue measureminimum elementrandom computationsrecursive functionalssemilattice of Turing degreesTuring degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Formal languages and automata (68Q45)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3967527)