4 ms·
But the thing is you are just trading off computability. Aren't you? > The theory Ordinals is algorithmically inexhaustible
by cscurmudgeon 7y ago
But the thing is you are just trading off computability. Aren't you?
> The theory Ordinals is algorithmically inexhaustible
- ProfHewitt 7y agoExcellent 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