Skip to content

Comment on A pilot project in universal algebra to explore new ways to collaborateparent

Comments

There is no a priori reason why the aimed for results should be unprovable ala Gödel.

However, it turns out it has been proven that it is. Tao says so in the post:

I will remark that the general question of determining whether one set of equational axioms determines another is undecidable.

Even though the general problem is undecidable, individual instances are still potentially solvable.

I remark that it's the "several equations -> several equations" that's undecidable

this project focuses only on "1 eq -> 1 eq", so it's even more of a gray area

Awesome thanks for clarifying

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.