Strong Computability and Variants of the Uniform Halting Problem
From MaRDI portal
Publication:5622171
DOI10.1002/malq.19710170117zbMath0218.02033MaRDI 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
03D10: Turing machines and related notions
Related Items
Complexity of Fractran and Productivity, Levels of undecidability in rewriting, 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, Complexity of certain decision problems about congruential languages, Verifying polymer reaction networks using bisimulation, A decision procedure using discrete geometry, The $\Pi^0_2$ -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity), A decision procedure using the geometry of convex sets, Diem-Grade Logischer Entscheidungsprobleme