2021/01/19 by Ben Goertzel, Goertzel, Ben
Computer Science · Mathematics · Physics and Astronomy · #Artificial Intelligence (cs.AI) #Bayesian Modeling and Causal Inference #Benford’s Law and Fraud Detection #FOS: Computer and information sciences #Statistical Mechanics and Entropy
paper · pdf · doi:10.48550/arxiv.2101.07498
openalex publication_date 2021/01/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
It is argued that a fuzzy version of 4-truth-valued paraconsistent logic (with truth values corresponding to True, False, Both and Neither) can be approximately isomorphically mapped into the complex-number algebra of quantum probabilities. I.e., p-bits (paraconsistent bits) can be transformed into close approximations of qubits. The approximation error can be made arbitrarily small, at least in a formal sense, and can be related to the degree of irreducible "evidential error" assumed to plague an observer's observations. This logical correspondence manifests itself in program space via an approximate mapping between probabilistic and quantum types in programming languages.