Linear Termination over N is Undecidable · HackerPapers discussions

Linear Termination over N is Undecidable — mentioned by nyrikki

Wed, 11 Oct 2023 19:03:03 GMT

Note this quote from the article. "One way to resolve the paradox, therefore, is to put these types into a hierarchy, so they can only contain elements of a “lower level” than themselves. Then a type can’t contain itself, which avoids the self-referentiality that creates the paradox." This is similar to constraints of making something semi-decidable or recursively enumerable. Provable, recursively enumerable, semidecidable, and turing recognizable are all the same thing described in different ways. Some things are easier to find in type theory, other in set theory and for some Turing machines…

Paper and discussion history. A mention is not an endorsement.

Linear Termination over N is Undecidable — mentioned by nyrikki

Wed, 04 Oct 2023 17:41:53 GMT

The lack of generally accepted definition for knowledge and intelligence makes these conversations difficult but the above post is important to remember. The paper has nothing to do with the common sense problem. While it is a preprint, I do wonder how useful this will be to improve generalization. Termination analysis on linear polynomials is undecidable over the naturals without many constraints and is undecidable ofer the rationals. If you think about how sstrees or even rtrees work, this isn't surprising to me that space and time are useful for compression which is required for…

Paper and discussion history. A mention is not an endorsement.