A computable version of the random signs problem and Kolmogorov complexity

Jack Jie Dai

Statistics & Probability Letters, 2004, vol. 67, issue 1, 27-31

Abstract: An effective solution to a computable version of the random signs problem is formulated using a coefficient from Kolmogorov complexity theory.

Keywords: Kolmogorov; complexity; theory; The; random; signs; problem (search for similar items in EconPapers)
Date: 2004
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167-7152(03)00387-0
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:67:y:2004:i:1:p:27-31

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().