Print

Please login or register.
1 Hour 1 Day 1 Week 1 Month Forever
Login with username, password and session length

[Draco18s]

Here's a description of the Infinity Machine.

The question is: is it powerful enough to run Dwarf Fortress?

[Musluk]

After a point, your dwarves would die before you booted up the game.

[Sowelu]

That...was awesome.

[Veroule]

I got lost in considering Goldbach's conjecture after reading it.  Then I answered it as clearly false after an infinitessmal period of time.  Both 0 and 2 are even numbers and can not be repesented as the sum of 2 prime numbers.  I then spent a short time questioning the defnition of prime numbers, and decided that 0 does meet all the qualifications for a prime number.  Basic arithmetic and logic were then able to define Goldbach's conjecture to be possible.

I could throw both of those away just like I threw away the notion that 0 is not a prime number.  However, that would result in all numbers being meaningless and the 101 page proof that 1+1=2 wouldn't even be useful as toilet paper.

Computationally it took a small part of my brain less then 2 seconds to do this, but about 2 minutes to explain all the results to rest of my brain, and infinitely longer to type it out into a post.  Perhaps his computer description somehow describes how the human brain actually works.

[Idiom]

The real question is: can we upload Toady so that he can program at an infinite rate?

[woose1]

Ow my brain juices. Hurt

[Draco18s]

The real question is: can we upload Toady so that he can program at an infinite rate?

Probably!

[Draco18s]

I got lost in considering Goldbach's conjecture after reading it.  Then I answered it as clearly false after an infinitessmal period of time.  Both 0 and 2 are even numbers and can not be repesented as the sum of 2 prime numbers.

You have Goldbach's conjecture wrong, I looked it up.

Every even integer greater than 3 can be written as the sum of two primes.

[Veroule]

I got lost in considering Goldbach's conjecture after reading it.  Then I answered it as clearly false after an infinitessmal period of time.  Both 0 and 2 are even numbers and can not be repesented as the sum of 2 prime numbers.

You have Goldbach's conjecture wrong, I looked it up.

Every even integer greater than 3 can be written as the sum of two primes.

I just went by what was written in the article you referenced.  It didn't quite make that distinctinction.

A few other thoughts since ran through my head concluding the using Goldbach's conjecture as the basis for calculating prime numbers can cut the computational time to calucalte them significantly.  This could also be use as a test-proof of the conjecture.

Start with the list 2, 3, 5.
Add your 2 highest items +2 (3+5+2==10)
Then divide by 2 (10/2==5)
Find the highest prime in the list  that is less than equal to the divdend (5<=5)
If the prime is exactly matching the dividend (5!=5) move on
(3+5+4)/2=6
5<=6
Test original number-prime for prime (isPrime(12-5))
 (12-5)==7, is prime
When true add to list and move on, other wise try a smaller prime
Next is 14, 14/2==7 already in list move on
Next is 16, 16//2==8 next lower is 7
isPrime(16-7) tests 9 and finds it lacking
isPrime(16-5) tests 11 and finds it valid, adds 11 to the list
Next is 20(11+7+2), 20/2==10 next lower is 7
isPrime(20-7) tests 13 and add it to the list
Next is 26 (13+11+2), 26/2==13
13 is already on the list move on.
Next is (13+11+4), 28/2==13
isPrime(28-13) tests 15 and find it lacking
isPrime (28-11) tests 17 and finds it valid, adds 17 to the list

I followed this logic for a little ways and realized that it will properly generate a list of prime numbers.  It nealry turns all prime numbers into a binary tree and reduces the amount of testing that is involved.  I would say that since it uses Goldbach's conjecture as a sourcepoint for its logic and can then procede to perfectly map the first 10K primes it adequately proves his conjecture.  For computational purposes it is skipping over many numbers, using the prime number to help in finding where the next one is.

After just a little ways this method will fail to actually prove Goldbach's conjecture, because it has skipped numbers.  Again it picks up the primes progression and uses that to determine its steps.  It does use the Conjecture for a piece of its underlying alogarithm, such that its search for primes is predicated that an even number minus a prime will result in another prime.

I think the actual goal is to cut prime number calculation by about 1/8th.  I really don't know how that is useful, but if it interests you I can expound upond the specifcs for an isPrime function that further cuts down the computational load, or just bable in greater detail about the code to match the psuedocode above.

[woose1]

Veroule, why do you do this to me? Why? I am just a innocent bystander, being directly indirectly harmed by your complicated gestures and accusations that most of the posts and allegations in here are false. think of the children Veroule, think of the innocent children you have harmed and given mild headaches from your boring lectures.

[Veroule]

Bah, human children!  Only dwarven children matter. [chuckle]

Yeah, loads of math and sort of code in my last post.  It is all in fun unless you are a computer science major, or have a job as a programmer.  In both cases if you need to generate a list of prime numbers then my last post is close to the best alogarithm.

I went on a slight tangent; and since this topic wasn't to far rooted in DF, I didn't care.  I am not kidding when I say some part of my brain figured all of it out in less then 2 seconds.  Getting it all coordinated into language, of any kind, is much harder.

[Exponent]

...It does use the Conjecture for a piece of its underlying alogarithm, such that its search for primes is predicated that an even number minus a prime will result in another prime.

Goldbach's conjecture doesn't guarantee this.  It merely guarantees that given an even number (greater than 3), there exists some prime number, such that if you subtract this prime number from the even integer, the result will be another prime number.  But this is certainly not going to be true for all prime numbers.  It is quite easy to discover prime numbers that, when subtracted from an even integer, do not result in another prime number.  (e.g., 14 - 5 = 9)

Maybe this doesn't affect your algorithm, though; I didn't quite follow the description (it's spring break, and I don't feel like using my brain too much).

[RAM]

Oh, sure, it calculates infinite values, and can complete any computation over the course of 2 second, but every other second it performs only 1 calculation. I don't enjoy 1 FPS...

[PTTG??]

Oh, sure, it calculates infinite values, and can complete any computation over the course of 2 second, but every other second it performs only 1 calculation. I don't enjoy 1 FPS...

Yes, but during the other second it reaches infinite FPS. So, on average, it has infinite FPS. Thus, all dwarves will die of old age in the first 1/infinity second. Nice.

[Dasleah]

Toady's probably just going to swoop in and MATH THE CRAP OUT OF ALL OF YOU.