Resolute sequences in initial segment complexity

DOI10.1142/9789814449274_0001MaRDI QIDQ5737981zbMATH OpenOpenAlexFDO

Authors George Barmpalias, Rodney G. Downey

Publication date 31 May 2017

Published in Proceedings of the 12th Asian Logic Conference (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789814449274_0001

zbMATH Keywords

computably enumerable setsKolmogorov complexitytrivial reals

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Algorithmic randomness and dimension (03D32)

Recommendations

• Randomness for computable measures and initial segment complexity
• Mass problems and initial segment complexity
• Descriptive complexity of computable sequences revisited
• On the number of infinite sequences with trivial initial segment complexity
• Kolmogorov complexity of initial segments of sequences and arithmetical definability

Cited in

(1)

• Sequentiality and piecewise-affinity in segments of Real-PCF

This page was built for publication: Resolute sequences in initial segment complexity

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