What if we made a program that would make the same calculations 10, 100 or even 1 million times comparing those one milline(or whatever) results with each other to check for errors. Doing just that in a infinite or selected number of loops. That would be really easy to make. Even I could probably pull it off in Blitz Basic. It would probably be extremly easy to make it in0 C/C++ for those that can do it.
This is a "universial" basic version of the simplest stability check prg. that I can think of. Why does it have be so "advanced"? A cpu doesn't care if it's hard or not. Bits are bits anyway...
Universal basic example;
loop:
randomize timer; REM Whatever the current basic language require to randomize RND to the clock timer.
e#=rnd(1) ;REM This selects a number floatingpoint number between 0 and 1 var. 1
e2#=rnd(1) ; REM This selects a number floatingpoint number between 0 and 1 var. 2
for tell=1 to 10000000 ; REM start a counter for 10 million repeats
res#=e#+e2# ; REM add the two values
res2#=e#+e2# ; REM add the same values again
If re2s#=res# ; REM Check if they match
ok=1 ; REM If they do then OK
else
ok=0 ; REM If they don't then not ok
end if
If ok=0 ; REM If ok equals not ok(0)
end ; REM quit program
end if
next tell
goto loop ; REM Repeat loop if all is okdokey.
I've not tried the code. But this would in theory check the answer 10.000.000 times before changing values. This program would in not put any strain on the memory but mainly the cpu. (theoretically)
Please tell me if I'm way off.....