|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
26 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
A Computational Complexity-Theoretic Elaboration of Weak Truth-Table Reducibility | | Kohtaro Tadaki
; | | Date: |
19 Jul 2011 | | Abstract: | The notion of weak truth-table reducibility plays an important role in
recursion theory. In this paper, we introduce an elaboration of this notion,
where a computable bound on the use function is explicitly specified. This
elaboration enables us to deal with the notion of asymptotic behavior in a
manner like in computational complexity theory, while staying in computability
theory. We apply the elaboration to sets which appear in the statistical
mechanical interpretation of algorithmic information theory. We demonstrate the
power of the elaboration by revealing a critical phenomenon, i.e., a phase
transition, in the statistical mechanical interpretation, which cannot be
captured by the original notion of weak truth-table reducibility. | | Source: | arXiv, 1107.3746 | | 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