The transition to printing 7=111 binary happens right around 88 million ticks It displays the initial 5=101 binary, at only 40 million ticks now.įor those who don't like waiting even that long, here's the same programmed computer run up to 87.65M ticks, so the 5 has already been printed. Looks good! I've edited my post above to include the reprogrammed version as well. With 64-bit Golly 2.8 with 12 GB of hash memory and a step size of 2^18 (8^6) it can reach about 1.2 instructions/s on my computer, so all prime numbers below 100 can be generated in less than 2 hours. Simeks wrote:Because of the recent interest, I wrote an updated version of the prime number program. Someone with a faster computer could maybe run it and make sure it performs as advertised.? I didn't have any trouble running the script. But it seems as if there's something else that goes wrong on occasion. 64-bit is the source of can't-run-Python problems more often than not - along with the mistake of trying to install Python 3.x instead of 2.7.x with x != 11. That said, there are quite a few people who seem to have mysterious problems. Golly usually finds the python27.dll that it needs, without any further configuration. I am not with my computer these days so you can do it yourself I think.įor people running Windows, installing Python is usually just a matter of picking the right installer, 32-bit or 64-bit, to match their version of Golly, and running it. Coban you can do it yourself, you just have to copy simeks's code into the assembly.py script then run it with installing python is not difficult at all, you just have to download an installer and click.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |