pantantrant

I may be wrong about this, feel free to offer constructive criticism:

Step 1: Load the program and initialize my Halting Problem program's variable n to 0.

Step 2: Save the register context (meaning all the values in all the registers in a CPU) to memory location A.

Step 3: Step variable n + 1 instructions.

Step 4: Save the register context (meaning all the values in all the registers in a CPU) to memory location B.

Step 5: Compare the contents of memory location A to memory location B. If they match exactly, then exit with a return code of "This program is in an infinite loop", if they don't match exactly, then goto Step 2.

The variable n is an unsigned fixed point arbitrary precision integer.

If this solves the Halting Problem as proposed by Alan Turing, then does this also solve P versus NP?

An example of this working:

ax is a 2 bit register initialized to 0.

100: add 1 ax

101: jmp 100

ax is 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3

0 is compared to 1, 1 is compared to 3, 3 is compared to 2, 2 is is compared to 2, wait, that's an infinite loop...

Well, my program basically detects if a infinite loop is of 1 iteration or two iterations or three iterations or ... iterations, but only infinite loops and not finite loops and in a finite amount of time. This means that finite loops don't trigger my program ever, only infinite ones after a finite amount of time.

TLDR: A turing machine can run my program and determine whether any other program halts or infinite loops in a finite amount of time, never infinite only if the variable n can be infinitely large.

In my previous post, I made a pseudo random number generator (licensed under the Public Domain) where every bit is 42.5% random in 10 lines of code and it outputs a byte every clock cycle. Thoughts on this?

Basically, it's a filter against my simple pseudorandom number generator so it keeps narrowly losing and winning for it is an extreme rarity.

To win, one idea gets 43% or more of the votes. If two ideas get 43% or more of the votes, restart. Or it could not restart but something else, am open to changing my mind about the restarting idea.

#include <stdio.h>

unsigned integer = 0;

unsigned int i = 0;

int main (char argc, char* argv[]) {

    while (i<1000) {

        integer = integer + i;

        i = i + 1;

        printf("%u\n", integer);

    }

};

Feel free to tell me ways to improve this.