|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
25 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Equivalent characterizations of partial randomness for a recursively enumerable real | | Kohtaro Tadaki
; | | Date: |
17 May 2008 | | Abstract: | A real number alpha is called recursively enumerable if there exists a
computable, increasing sequence of rational numbers which converges to alpha.
The randomness of a recursively enumerable real alpha can be characterized in
various ways using each of the notions; program-size complexity, Martin-L"{o}f
test, Chaitin’s Omega number, the domination and Omega-likeness of alpha,
the universality of a computable, increasing sequence of rational numbers which
converges to alpha, and universal probability. In this paper, we generalize
these characterizations of randomness over the notion of partial randomness by
parameterizing each of the notions above by a real number Tin(0,1]. We thus
present several equivalent characterizations of partial randomness for a
recursively enumerable real number. | | Source: | arXiv, 0805.2691 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER