We investigate two constants c T and r T , introduced by Chaitin and Raatikainen respectively, defined for each recursively axiomatizable consistent theory T and universal Turing machine used to determine Kolmogorov complexity. Raatikainen argued that c T does not represent the complexity of T and f
Kolmogorov complexity of initial segments of sequences and arithmetical definability
β Scribed by George Barmpalias; C.S. Vlek
- Book ID
- 113927448
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 301 KB
- Volume
- 412
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Suppose that γ__x~k~__γ~__k__ββ~ is a countable sequence of real numbers. Working in the usual subsystems for reverse mathematics, RCA~0~ suffices to prove the existence of a sequence of reals γ__u~k~__γ~__k__ββ~ such that for each __k__, __u~k~__ is the minimum of {__x__~0~, __x__~1~,
## Abstract **Summary:** A novel twoβstep polymerization strategy allowing the integration of sequenceβdefined oligopeptides into synthetic polymers has been demonstrated by the successful synthesis of an oligopeptideβ__block__βpoly(__n__βbutyl acrylate) copolymer. The approach utilizes a solidβpha