FUNCTIONAL METHOD OF UNIVERSAL CALCULATION BY EXTENDED PRODUCT OF FORMAL MATRIX

摘要

The invention relates to central processing units (1) programmable by functional software devices (3) based on the sole concept of application, (6) to (10), without a set of instructions, the complex sequential decoding of which is opposes a parallelism independent of the software devices themselves (3), allowing, by the product (5) of binary matrices (2), a first so-called technical parallelism (24), autonomous and independent of functional algorithms, yet realizing the latter in parallel regardless of their initial description (3). The second parallelism, called applicative, constituted by binary hollow diagonal matrices (4) augmented by index (13) located inside the technical parallelism (2), simultaneously performs several tasks (4), always without instruction or planner of tasks. The device consists of an extended matrix product operation (24) on two sets of memory words, (13) to (16), representing two triangular matrices (2), such that one allows the result of the product of its opposite (extended to a square matrix) by itself and vice versa (2), according to three phases called application (A), expansion (E) and reduction (R). The results are expressed by the binary connections (24) defined by the product between the binary rows and columns. The software devices are vectors (17) of sequences of hollow binary diagonal matrices (4) extended with index words (13), for each dimension, referring to positions in the software device (17). The device according to the invention is particularly intended for intrinsic formal calculations (6), in computer science and in cognitive semantics.