Pages that link to "Item:Q5622171"
From MaRDI portal
The following pages link to Strong Computability and Variants of the Uniform Halting Problem (Q5622171):
Displayed 11 items.
- Levels of undecidability in rewriting (Q627134) (← links)
- Finite complete rewriting systems and the complexity of word problem (Q791314) (← links)
- Some undecidability results for non-monadic Church-Rosser Thue systems (Q1057264) (← links)
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups (Q1074716) (← links)
- Complexity of certain decision problems about congruential languages (Q1085618) (← links)
- Verifying polymer reaction networks using bisimulation (Q2003997) (← links)
- A decision procedure using discrete geometry (Q2560235) (← links)
- The $\Pi^0_2$ -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity) (Q3636833) (← links)
- A decision procedure using the geometry of convex sets (Q4047533) (← links)
- Diem-Grade Logischer Entscheidungsprobleme (Q4135479) (← links)
- Complexity of Fractran and Productivity (Q5191114) (← links)