How Does This PLUSr Work?

Fleming Research LLC; provides a tool to find a reasonable Boolean expression/equation from a truth table. This method, the Progressive Logic Unit Subroutine or PLUSr, finds an optimum Boolean expression for real-world data, even if its truth table is too big to list and its lines are missing or repeated. For instance, using the Penn Machine Learning Benchmarks problem in DNA in a 3,196 x 180 dataset, PLUSr obtained accuracies of 97.5% in category 1 in 12.4 seconds, 95.8% in category 2, and 85.8% in category 3, all testing on an unseen set of data and in a fraction of the time it takes for AI using linear regression. The PLUSr allows a program to increase linearly in time with a linear increase in variables. Since it uses only integer mathematics, it is swift and does not need expensive GPUs. It can also run on simpler platforms with faster, lower-level languages. Though its results may be approximations, they are close and exactitude is unnecessary for useful answers. The question is not “Is it perfect?” but “Can you do better in the same length of time?” The PLUSr improves generative AI programming, robot microcontrollers, medical image analysis, and many other tasks. This paper explains its core principles and demonstrates its utility.

Overall, the PLUSr raises the IQ of artificial intelligence.