Advanced search
2 files | 743.44 KB Add to list

Notes on sum-tests and independence tests

(2011) THEORY OF COMPUTING SYSTEMS. 48(2). p.247-268
Author
Organization
Abstract
We study statistical sum-tests and independence tests, in particular for computably enumerable semimeasures on a discrete domain. Among other things, we prove that for universal semimeasures every Sigma0/1-sum-test is bounded, but unbounded Pi0/1-sum-tests exist, and we study to what extent the latter can be universal. For universal semimeasures, in the unary case of sum-test we leave open whether universal Pi0/1-sum-tests exist, whereas in the binary case of independence tests we prove that they do not exist.
Keywords
Independence tests, Kolmogorov complexity, Sum-tests

Downloads

  • TOCSplain.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 226.43 KB
  • 983763.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 517.01 KB

Citation

Please use this url to cite or link to this publication:

MLA
Bauwens, Bruno, and Sebastian Terwijn. “Notes on Sum-tests and Independence Tests.” THEORY OF COMPUTING SYSTEMS 48.2 (2011): 247–268. Print.
APA
Bauwens, B., & Terwijn, S. (2011). Notes on sum-tests and independence tests. THEORY OF COMPUTING SYSTEMS, 48(2), 247–268.
Chicago author-date
Bauwens, Bruno, and Sebastian Terwijn. 2011. “Notes on Sum-tests and Independence Tests.” Theory of Computing Systems 48 (2): 247–268.
Chicago author-date (all authors)
Bauwens, Bruno, and Sebastian Terwijn. 2011. “Notes on Sum-tests and Independence Tests.” Theory of Computing Systems 48 (2): 247–268.
Vancouver
1.
Bauwens B, Terwijn S. Notes on sum-tests and independence tests. THEORY OF COMPUTING SYSTEMS. Springer Verlag; 2011;48(2):247–68.
IEEE
[1]
B. Bauwens and S. Terwijn, “Notes on sum-tests and independence tests,” THEORY OF COMPUTING SYSTEMS, vol. 48, no. 2, pp. 247–268, 2011.
@article{779761,
  abstract     = {We study statistical sum-tests and independence tests, in particular for computably enumerable semimeasures on a discrete domain. Among other things, we prove that for universal semimeasures every Sigma0/1-sum-test is bounded, but unbounded Pi0/1-sum-tests exist, and we study to what extent the latter can be universal. For universal semimeasures, in the unary case of sum-test we leave open whether universal Pi0/1-sum-tests exist, whereas in the binary case of independence tests we prove that they do not exist.},
  author       = {Bauwens, Bruno and Terwijn, Sebastian},
  issn         = {1432-4350},
  journal      = {THEORY OF COMPUTING SYSTEMS},
  keywords     = {Independence tests,Kolmogorov complexity,Sum-tests},
  language     = {eng},
  number       = {2},
  pages        = {247--268},
  publisher    = {Springer Verlag},
  title        = {Notes on sum-tests and independence tests},
  url          = {http://dx.doi.org/10.1007/s00224-009-9240-4},
  volume       = {48},
  year         = {2011},
}

Altmetric
View in Altmetric
Web of Science
Times cited: