A Computational Complexity-Theoretic Elaboration of Weak Truth-Table Reducibility

Details A Computational Complexity-Theoretic Elaboration of Weak Truth-Table Reducibility A Computational Complexity-Theoretic Elaboration of Weak Truth-Table Reducibility

2011-07-19

arxiv.org/abs/1107.3746v1

Mathematics

Logic

25 pages, LaTeX2e, no figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Computational Complexity-Theoretic Elaboration of Weak Truth-Table Reducibility does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Computational Complexity-Theoretic Elaboration of Weak Truth-Table Reducibility, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Computational Complexity-Theoretic Elaboration of Weak Truth-Table Reducibility will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-514792