User:IssaRice/Computability and logic/Some important distinctions and equivalences in introductory mathematical logic: Difference between revisions
No edit summary |
No edit summary |
||
| Line 41: | Line 41: | ||
* computably enumerating in order = deciding | * computably enumerating in order = deciding | ||
* diagonalization lemma = rogers fixed point theorem | * diagonalization lemma = rogers fixed point theorem | ||
* Kleene's T predicate, godel beta function, Prf(m,n) | * Kleene's T predicate, godel beta function, Prf(m,n) https://machinelearning.subwiki.org/wiki/User:IssaRice/Computability_and_logic/Bounded_computation_trick | ||
==External links== | ==External links== | ||