Excellent question! Proof checking in the theory *Ordinals* is algorithmically c... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

ProfHewitt on Dec 17, 2019 | parent | context | favorite | on: Kurt Gödel and the Mechanization of Mathematics

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 on Dec 18, 2019 [–]

Thank you! Can't believe I had a conversation with Prof. Carl Hewitt here! Love the actor calculus btw!

ProfHewitt on Dec 18, 2019 | [–]

You are very welcome!

Cheers, Carl

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact