scientific article; zbMATH DE number 3559552
From MaRDI portal
Publication:4132513
zbMath0359.02041MaRDI QIDQ4132513
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Recursive equivalence types of sets and structures, isols (03D50) Computability and recursion theory (03D99)
Related Items (6)
Computational depth and reducibility ⋮ Computational depth and reducibility ⋮ DEGREES OF RANDOMIZED COMPUTABILITY ⋮ Diagonally non-computable functions and fireworks ⋮ On empirical meaning of randomness with respect to parametric families of probability distributions ⋮ Non-stochastic infinite and finite sequences
This page was built for publication: