Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Statistical Mechanical Interpretation of Algorithmic Information TheoryComputation-Theoretic Clarification of the Phase Transition at Temperature \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T=1$$\end{document}

A Statistical Mechanical Interpretation of Algorithmic Information Theory: Computation-Theoretic... [The notion of weak truth-table reducibility plays an important role in recursion theory (see e.g. Nies [27] and Downey and Hirschfeldt [14]). For any sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A, B\subset \mathbb {N}$$\end{document}, we say that Ais weak truth-table reducible toBWeak truth-table reducibility, denoted \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A\le _{wtt} B$$\end{document}, if there exist an oracle Turing machine M and a total recursive function \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$g:\mathbb {N}\rightarrow \mathbb {N}$$\end{document} such that (i) A is Turing reducible to B via M and (ii) on every input \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n\in \mathbb {N}$$\end{document}, the machine M only queries natural numbers at most g(n).] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Statistical Mechanical Interpretation of Algorithmic Information TheoryComputation-Theoretic Clarification of the Phase Transition at Temperature \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T=1$$\end{document}

Download PDF
22 pages

Loading next page...
 
/lp/springer-journals/a-statistical-mechanical-interpretation-of-algorithmic-information-i9uM5OoNps

References (0)

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Springer Singapore
Copyright
© The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2019
ISBN
978-981-15-0738-0
Pages
103 –125
DOI
10.1007/978-981-15-0739-7_8
Publisher site
See Chapter on Publisher Site

Abstract

[The notion of weak truth-table reducibility plays an important role in recursion theory (see e.g. Nies [27] and Downey and Hirschfeldt [14]). For any sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A, B\subset \mathbb {N}$$\end{document}, we say that Ais weak truth-table reducible toBWeak truth-table reducibility, denoted \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A\le _{wtt} B$$\end{document}, if there exist an oracle Turing machine M and a total recursive function \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$g:\mathbb {N}\rightarrow \mathbb {N}$$\end{document} such that (i) A is Turing reducible to B via M and (ii) on every input \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n\in \mathbb {N}$$\end{document}, the machine M only queries natural numbers at most g(n).]

Published: Nov 12, 2019

There are no references for this article.