Superpositioner -- A non-logical computation model

TL;DR

The paper introduces the superpositioner, a novel non-logical computation model formed by interconnected Boolean functions, which may surpass Turing computation and enable advanced intelligent functions.

Contribution

It proposes the superpositioner as a new computation model that integrates Boolean functions in feedback loops, potentially exceeding classical Turing limits.

Findings

Superpositioner combined with dispositioner can surpass Turing computation.

Superpositioner enables new functions like endogenous feelings and dynamic understanding.

Preliminary ideas for implementing superpositioner are discussed.

Abstract

We have been striving to exceed computational complexity, and in the process, we have come to realize the dilemma of classical computing, and in turn we realize that superpositioner may be a way to solve. A superpositioner is a model formed by several Boolean functions that their variables and function values are feeding back to each other. The component of the superpositioner is the reentry function, which can be fully described by classical logic and can be calculated by classical computation, but the superpositioner as a whole is a non-logical entity, and it is impossible for classical computation to fully compute it. In this article, we present the concept of a superpositioner and discuss its basic properties. We find that the superpositioner + dispositioner will form a new type of computation model whose capabilities can surpass Turing computation. We envision that this new model will help implement these functions in the intelligent agent: a whole new way of programming and a whole new way of learning, endogenous feelings, analogies and associations, forming understanding, dynamic action, participating in the formation of subjectivity, and more. We will also discuss how to implement superpositioner in the most preliminary way.