{"paper":{"title":"Upper semicomputable sumtests for lower semicomputable semimeasures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bruno Bauwens","submitted_at":"2013-12-05T22:15:43Z","abstract_excerpt":"A sumtest for a discrete semimeasure $P$ is a function $f$ mapping bitstrings to non-negative rational numbers such that \\[\n  \\sum P(x)f(x) \\le 1 \\,.\n  \\] Sumtests are the discrete analogue of Martin-L\\\"of tests. The behavior of sumtests for computable $P$ seems well understood, but for some applications lower semicomputable $P$ seem more appropriate. In the case of tests for independence, it is natural to consider upper semicomputable tests (see [B.Bauwens and S.Terwijn, Theory of Computing Systems 48.2 (2011): 247-268]).\n  In this paper, we characterize upper semicomputable sumtests relative"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1718","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}