Here's the facts dude. I figured out an algorithm that allows a
computer to proof read any and all programs. But, for it to work it
has to include a decompiler that decompiles every single program that
appears on the hard drive, and or any other portable means provided by
any form of media. The OS is written around the compiler/decompiler.
The programming language is very simple it's a hybrid of Fortran and
Boolean Logic Gates. Other than math functions, there are only seven
symbols for the programmer to recognize.
formatting link
With that, the computer can track variables and strings, even diagnose
truth tables of any given program and determine if it is a driver,
application or a game. There is no way to build spyware, viruses, or
adware. There is no reason for anti-virus software with a list of
viruses that at this point in time is around 60,000 known computer
viruses. All it does is check the code to insure that it came from
the compiler. Compilers have a section of binary code that they
output for every command in English or symbols that is sent to the
disk in binary as the executable file. Decompiling it, allows a
computer to actually build a truth table, and it can check for mouse
clicks, graphic user interfaces, and associations of these in such
manner as to define if the program is under the Users control.
The absolute best computer scientists already know that this language
has the potential of being the fastest executed, and easier to use the
C or Visual Basic because, it can use machine code and assembly
language macros that execute the fastest built from assembly language,
added to compiler and decompiler as components. In Visual Basic, that
would be an object in your library. As long as the decompiler can
track data, and recognize function, then it can refuse to run any
program that isn't written by the compiler based upon the OS requiring
a confirmation from the decompiler/simulator.
Your programming window would look just like this:
formatting link
Very Similar to LabView:
formatting link
It's based upon the Algebra of Sets, and there are data sets,
instruction sets, and result sets that are all faithfully represented
by ones and zeros in a fashion of presence and direction within the
program. It works more like a flow chart, and it is not anywhere as
difficult to learn as Basic.
formatting link
The really cool part, you can eliminate unneeded code from your
source, and produce the fastest possible running program every time.
There are a series of logic gate reduction algorithms available from
De Morgan's Theorem on, and the process has been automated in software
more than one time. If you wanted to put encryption between the
decompiler and the truth tables, you'd make all allot harder. That
means that Proprietary software has a problem with being decompiled to
be deciphered for function and feature to insure that it isn't a
Trojan, carrying a virus, spyware, or adware.
formatting link
Yes, it's all doable, and if you looked into the CPU, Math Function
list, MMX and other extended features, you'd see that there is a way
to do things much much faster with the same CPU you already have.