The following pages link to New Computational Paradigms (Q5717055):
Displaying 7 items.
- On the power of recursive word-functions without concatenation (Q2112176) (← links)
- The undecidability of proof search when equality is a logical connective (Q2134939) (← links)
- On a theorem of Matiyasevich (Q2210378) (← links)
- On Post correspondence problem for letter monotonic languages (Q2271434) (← links)
- A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings (Q2964458) (← links)
- Martin Davis and Hilbert’s Tenth Problem (Q3305315) (← links)
- (Q5094119) (← links)