Strong Computability and Variants of the Uniform Halting Problem
From MaRDI portal
Publication:5622171
DOI10.1002/malq.19710170117zbMath0218.02033OpenAlexW2125724234MaRDI QIDQ5622171
Publication date: 1971
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19710170117
Related Items (11)
Complexity of certain decision problems about congruential languages ⋮ Levels of undecidability in rewriting ⋮ A decision procedure using the geometry of convex sets ⋮ Verifying polymer reaction networks using bisimulation ⋮ Diem-Grade Logischer Entscheidungsprobleme ⋮ Complexity of Fractran and Productivity ⋮ The $\Pi^0_2$ -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity) ⋮ A decision procedure using discrete geometry ⋮ Finite complete rewriting systems and the complexity of word problem ⋮ Some undecidability results for non-monadic Church-Rosser Thue systems ⋮ Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
This page was built for publication: Strong Computability and Variants of the Uniform Halting Problem
