MathDB1 problem
- 0 votes0 replies0 views
Automata-theoretic conjecture for game-semantic PCF-computations
Automata-theoretic conjecture. There is some class of automata that is strictly weaker than TMs yet powerful enough to implement all the game-semantic PCF-computations.