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

@article{Tadaki2011ACC,
  title={A Computational Complexity-Theoretic Elaboration of Weak Truth-Table Reducibility},
  author={Kohtaro Tadaki},
  journal={CoRR},
  year={2011},
  volume={abs/1107.3746}
}
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… CONTINUE READING