Computer Science - LeFreq/Singularity GitHub Wiki
This project has created new computer science which create another era of computer science. Here are a few of the main insights:
- Good architecture reduces code size logarithmically. This is a major gain and a critical design goal (for this project). There is no reason to have 25M lines of code -- not for software, and not for hardware drivers. This has been asymptotically quantified to 100 log2(basic_LOC); in other words, take the line count (LOC) of a machine language code-base (without subroutines?), and plug it into the equation above and you'll have something of a factor of the theoretically-ideal number of well-architected LOC.
- programming language theory and Kolmogorov quotient: programming language expressivity can be compared to get a measure of your computer language. This allows computer language designers to create the minimal computer language that is still readable.
- gospel of data ecologies: A complete, elegant answer to the OOP paradigm-- meeting all of its criteria, including modularity, re-useability, encapsulation, etc.
- When your code-base is over a million LOC for hardware (drivers, for example), then your hardware needs re-architected. Making proper standards for all I/O and interhardware communications, for example. There are also new ideas of geometric processing that allow better performance, for example, in hardware.
Two binary operators: the NOT operator and the PAIR operator compose the basic primitives for all other operations. NOT transforms the input into its opposite, PAIR outputs true when both match (logically equivalent to a NXOR, but not transistor equivalent).
PAIR: 00 -> 1 01 -> 0 10 -> 0 11 -> 1