News for hackers. Stuff that matters.
Re:Gödel’s first incompleteness theorem – an interactive tut... by evnp on Monday October 17, 2022 @04:10PM (#33238913)
Similar nit, when you ask "Will theorems() discover `theorem halting_problem (n) : ¬ computable_pred (λ c, ..."

I don't believe it will since `const alphabet` does not contain λ or ¬. Apart from my very slight indignance after answering that one incorrectly, loved the article! :)

There are no comments on this comment yet.