The following pages link to (Q3346295):
Displayed 11 items.
- Taking the Pirahã seriously (Q907196) (← links)
- Dynamical system where proving chaos is equivalent to proving Fermat's conjecture (Q1325710) (← links)
- A direct method for simulating partial recursive functions by Diophantine equations (Q1326783) (← links)
- On the expressiveness of choice quantification (Q1874242) (← links)
- Computable processes and bisimulation equivalence (Q2365394) (← links)
- The mathematical universe (Q2481233) (← links)
- Quantum principles and mathematical computability (Q2505977) (← links)
- DIAGONALIZATION EXHIBITED IN THE LIAR PARADOX, RUSSELL’S PARADOX AND GÖDEL’S INCOMPLETENESS THEOREM (Q5073951) (← links)
- The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes (Q5277914) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- From undecidability of non-triviality and finiteness to undecidability of learnability (Q6064265) (← links)