Search:

Hi
Googling 'Twins Fast Verifier' for download...(or MajorGeeks)

Twins Fast Verifier is practically a DRIVE And RAM error (with) verification tool.

How to work this small and free and clear...

Hello, for those like me who use a digital mixer as a secondary sound card from Behringer and model X32 Compact and MS Windows,
I have written a free diagnostic software (with the help of two gurus...

http://www.xstreme.it/pc5_noinstall.zip

Hello,

new version 5.0.0



http://www.xstreme.it/SetupPCV5.zip

http://www.xstreme.it/screenv5b3.jpg

this is beta of course, yet that's why the creator is requesting for feedback isn't it .

:D


consider adding a progress bar,
in Seven the p.bar consumes so many cycles, since it is a real...

thank you for reply :up:

0) this is beta :)

1) ok will add a buttons to close the multi :)

2) the size is fixed, i think this remain fixed for uncomplicated utilizes

3) in the final...

PrimeCores V4.0.0 Beta3


http://www.xstreme.it/pic/screen40.jpg

*

hi, i dont know intel compiler.....

1) if you've tried the GCC compiler , it is much slower than the Intel compiler ?

2) for porting my code into Linux , Intel compiler work on linux ?

TY

option two:
completely missing the point :ROTF:

you says
When the denominator goes to zero, the run-time (and memory) blows up to infinity - in other words, the algorithm fails.

i reply
use NaN and Float


sorry, i am not a native speaker,...

I really wanted to know your point of view....:)
I am new to this type of algorithm,
i are documented on this subject,
i thought that theory to solve the problem of zero value,
with a NAN...

see this

http://numbers.computation.free.fr/Constants/Algorithms/splitting.html

and this

http://algolist.ru/download.php?path=/maths/long_src.zip&pspdf=1

is useful ?

last question :)

with the binary splitting method

"the impractical" resolves anything ?

http://numbers.computation.free.fr/Constants/Programs/programs.html

yeah

if
n=100.5
w=64.0

o= n/(w-Log(n))Log(n/(w-Log(n))) = 1.6922085689143893

it's your formula ?

T Y V M :up:


the FLOAT instead of DOUBLE saves bits and gains efficiency,
but i do not know if YOUR APP can work with FLOAT...

I want to compile my code in 64 bit,
i want to know what compiler you use for 64-bit :)

ty

http://www.xstreme.it/p64.jpg

http://www.xstreme.it/primes64.zip

my first attempt...

:clap:
Indeed,
the difference is small, (bit)
i often wonder whether it is worth making two versions (64 / 32)
for this applications type ,
since the difference is minimal... :shrug::confused:

news

V 3.1.0 Patch :

http://www.xstreme.it/update.htm

To me.... this smells like a compliment :D:D:D:D

difference of six seconds , not bad, my 32-bit code is good, but
your code is truly remarkable......... :cussing:



:up:

try this on your laptop and post the screen please :)

(this is for the prime only..and 32 bit)

http://www.xstreme.it/oprimes.zip

My algo is custom, derivate from "even numbers" and the...

new release v3.1.0

http://www.xstreme.it/newscreens.jpg

http://www.xstreme.it/update.htm

:)

i write this small stability app based on the sum of FP (ArcTan) and Primes,
http://www.xstreme.it/pcdoz.jpg

i've removed the disk IO function because final results too busted in a small times...

Version 3.02 is out

can be downloaded from MajorGeek


http://www.xstreme.it/pic/s_pc1.gif

http://www.xstreme.it/pcdoz.jpg

currently also working on fully 64-bit version,

make a buffer of 512 byte

writing many times until you go to timeout,

so you have the time,

takes this time to make an estimate
without writing to disk many hours.

-------------