Lisp

53 readers

3 users here now

founded 1 year ago

MODERATORS

submitted 1 year ago by sym_num@alien.top to c/lisp

3 comments fedilink hide all child comments

I have conducted my own analysis and computational experiments regarding Gödel's incompleteness theorems in the style of Chaitin's Lisp. Is my approach correct? I am eagerly awaiting advice from those with expertise in this matter. Gödel’s Proof in Lisp. A Complex Book | by Kenichi Sasagawa | Nov, 2023 | Medium

you are viewing a single comment's thread
view the rest of the comments

[–] nick_recursion@alien.top 1 points 1 year ago

I think analyzing this article might help you determine the correctness of your approach.

"I am not provable in PM-LISP" https://stopa.io/post/269