Random numbers and an incomplete immune recursive set

DOI10.1007/3-540-45465-9_81MaRDI QIDQ4737222zbMATH OpenFDO

Authors Vasco Brattka

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Computable analysisimmune setsKolmogorov complexityr.e. closed setsrandom numbers

Mathematics Subject Classification ID

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

Recommendations

• Immunity for closed sets
• Computability on subsets of metric spaces.
• scientific article; zbMATH DE number 961049
• Logical Approaches to Computational Barriers
• Random reals as measures of natural open sets

Cited in

(6)

• Computability on subsets of metric spaces.
• On the degrees of constructively immune sets
• Immunity for closed sets
• Computability of Subsets of Metric Spaces
• scientific article; zbMATH DE number 961049 (Why is no real title available?)
• Notes on overt choice

This page was built for publication: Random numbers and an incomplete immune recursive set

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