3 ms·
Excellent question! Proof checking in the theory Ordinals is algorithmically checkable although theorems are not computationally enumerable because instances o
by ProfHewitt 7y ago
Excellent question!
Proof checking in the theory Ordinals is algorithmically checkable although theorems are not computationally enumerable because instances of strongly-typed induction axiom are uncountable.
- cscurmudgeon 7y agoThank you! Can't believe I had a conversation with Prof. Carl Hewitt here! Love the actor calculus btw!
- ProfHewitt 7y agoYou are very welcome! Cheers, Carl