2 papers
cs.CC2026
Prime Successor Irreducibility: Turing Machine Complexity, Kolmogorov Complexity, and Weakness-Based Formulations
Ben Goertzel, Bill Lauritzen
We develop conjectures and theorems expressing the idea that the prime sequence exhibits computational irreducibility in the transition from one prime to its successor. Informally,…
cs.AI2024
PLN and NARS Often Yield Similar strength confidence Given Highly Uncertain Term Probabilities
Ben Goertzel
We provide a comparative analysis of the deduction, induction, and abduction formulas used in Probabilistic Logic Networks (PLN) and the Non-Axiomatic Reasoning System (NARS), two…