scientific article; zbMATH DE number 2086685

zbMath1057.03052MaRDI QIDQ4737222

Vasco Brattka

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800950.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Kolmogorov complexityrandom numbersComputable analysisimmune setsr.e. closed sets

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (4)

Notes on overt choice ⋮ Computability on subsets of metric spaces. ⋮ Computability of Subsets of Metric Spaces ⋮ On the degrees of constructively immune sets

This page was built for publication: