A Breakthrough in Simpler Computation
October 24, 2018

Archived from an original LinkedIn post by Brian Greenforest.

Original Post

Since my last major breakthrough made on October 6th at 2:15pm, excited over the incredible idea of how simple the computation can be made without any explicitly defined combinators, state transition matrices, without any low-level pre-defined "assembly" instruction "sets."

I have advanced the idea further, discovering the extreme simplicity of the management of composed "child" components.

The world of alternative computation is quite magical, and is just about to open the infinite possibilities, enabling self-modifying genetic algorithms as first class citizens. And, of course, massive parallel computing, and unconstrained scalability.

The thing I'm working on is the best suited to run super sophisticated AI algorithms, but virtually any existing software or database could be ported, too.

Since October 6th there are zero people in the entire world actually do understand what I'm working on.

If there are any bright minds who wants to share trillions of dollars of future profits, who wants to change the face of the history, who wants to make the humanity immortal, who wants to transcend into a connected being of Earth, please, join me ASAP. I'm so fracking lonely in my search of a better world.