On the non-efficient PAC learnability of conjunctive queries — mentioned by nyrikki

Wed, 04 Oct 2023 21:27:04 GMT

The halting problem simply doesn't apply to biological neurons, they don't side step them, unless your context is humans writing down an Algorithm. The rules of a human writing down an algorithm is the same thing as a Turing machine running an algorithm. The halting problem applies for any system of computation that is at least as powerful as a TM, including any type of arithmetic or non-arithmetic calculation that is well-defined, AKA deterministic. Cortical neuron firing is non-deterministic and more closely is modeled as probabilistic but still stochastic.…

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

On the non-efficient PAC learnability of conjunctive queries · HackerPapers discussions

On the non-efficient PAC learnability of conjunctive queries — mentioned by nyrikki