搜索结果: 1-2 共查到“数理逻辑与数学基础 reducibility”相关记录2条 . 查询时间(0.046 秒)
A Computational Complexity-Theoretic Elaboration of Weak Truth-Table Reducibility
algorithmic information theory algorithmic randomness weak truth-table reducibility
2011/9/14
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 functi...
Almost reducibility for finitely differentiable SL(2,R)-valued quasi-periodic cocycles
reducibility finitely differentiable SL(2,R)-valued quasi-periodic cocycles
2010/11/12
Quasi-periodic cocycles with a diophantine frequency and with values in SL(2,R) are shown to be almost reducible as long as they are close enough to a constant, in the topology of k times differentia...