The Dink Network

Dink FrontEnd not working

August 25th 2006, 01:18 AM
wizardg.gif
slayer4990
Peasant He/Him Canada
Foppery and Whim! 
Whenever i try to open Dink FrontEnd, recently i started getting an error that says "Access Violation at adress 0040371D in module 'dinkFrontEnd.exe'. Read of adress FFFFFFF7." And then it doesn't work. Does anyone know what i might have done and or how to fix this.
August 25th 2006, 02:06 AM
death.gif
FFFFFFF7 is Finally the Final Final Final Final And very Final Fantasy 7. As to the rest, I have not a clue... I have not gotten this error, and I do not know why it would occur.

Are you using DFARC 2?
August 25th 2006, 02:19 AM
burntree.gif
Striker
Noble She/Her United States
Daniel, there are clowns. 
Wow... your jokes are even worse than mine.
August 25th 2006, 02:23 AM
death.gif
I will take that as a compliment, sir.
August 25th 2006, 02:53 AM
wizardg.gif
slayer4990
Peasant He/Him Canada
Foppery and Whim! 
i use DFarc 2 as well i was just curious about dinkfrontend.
August 25th 2006, 07:08 AM
custom_king.png
redink1
King He/Him United States bloop
A mother ducking wizard 
DinkFrontend will crash if you have around more than 50 D-Mods installed.
August 25th 2006, 09:53 AM
wizardg.gif
slayer4990
Peasant He/Him Canada
Foppery and Whim! 
huh, fifty-two and counting, thanks redink
August 28th 2006, 05:28 PM
slimeb.gif
DaVince
Peasant He/Him Netherlands
Olde Time Dinkere 
Use DFArc, it has no limits.
August 28th 2006, 05:43 PM
custom_magicman.gif
magicman
Peasant They/Them Netherlands duck
Mmmm, pizza. 
No, no, no, no, no, no, no, no, no, no, no, no, there's no limit!
August 28th 2006, 06:09 PM
burntree.gif
Striker
Noble She/Her United States
Daniel, there are clowns. 
Everybody to the limit!
Everybody to the limit!
August 29th 2006, 01:01 PM
slimeb.gif
DaVince
Peasant He/Him Netherlands
Olde Time Dinkere 
You should have marked the pauses somehow!

No no, no nono no, no no nono, no nothere's no li-mit!
August 30th 2006, 01:52 AM
death.gif
Come on fhqwhgads!!
August 30th 2006, 04:54 AM
custom_magicman.gif
magicman
Peasant They/Them Netherlands duck
Mmmm, pizza. 
Yeah, that's what Striker referred to, but he removed the "fhqwhgads" from his post.
August 30th 2006, 10:34 AM
slimeb.gif
DaVince
Peasant He/Him Netherlands
Olde Time Dinkere 
Everybody come on fhqwhgads!

I used to love it. I forgot it after a while. Now I remember again. Good? Or... not so good?
August 30th 2006, 04:02 PM
death.gif
fhqwhgads is the longest word in the English language with only one vowel.
August 30th 2006, 05:24 PM
farmer.gif
I say come on fhwhghgughagads!
August 30th 2006, 05:27 PM
slimeb.gif
DaVince
Peasant He/Him Netherlands
Olde Time Dinkere 
If you can't spell it, don't spell it.
August 30th 2006, 05:49 PM
custom_magicman.gif
magicman
Peasant They/Them Netherlands duck
Mmmm, pizza. 
Can't you see he's trying to improvise? You have absolutely no sense of creativity, have you?
August 31st 2006, 02:29 PM
knightg.gif
cypry
Peasant He/Him Romania
Chop your own wood, and it will warm you twice. 
Everything has a limit. Even computers. Make a program that will randomly generate 2,000,000 DMODs and you'll see.
August 31st 2006, 03:23 PM
slimeg.gif
metatarasal
Bard He/Him Netherlands
I object 
We'll just have to create a more powerful computer then...

One that can handle at least 2,000,001 DMODs...
August 31st 2006, 04:03 PM
fish.gif
Simeon
Peasant He/Him Netherlands
Any fool can use a computer. Many do. 
There are quite a few problems that even the most powerful computers can't solve, even if the calculation continues till the end of time or so
August 31st 2006, 05:32 PM
farmer.gif
Forty-two is the answer. Now, come up with the question, computer. And for every hundred million years you spend not giving me the answer, that's another ass whooping in your favor.
September 1st 2006, 02:05 AM
wizard.gif
Chrispy
Peasant He/Him Canada
I'm a man, but I can change, if I have to.I guess. 
I know a guy who solves NP problems in his head.

(Well, not really, but it's close)
September 1st 2006, 02:17 AM
death.gif
Hey! He can say something on this message board just by thinking? How amazing is that?
September 1st 2006, 10:15 AM
custom_magicman.gif
magicman
Peasant They/Them Netherlands duck
Mmmm, pizza. 
But still it's impossible to write a program that can determine for every program if it has an eternal loop.
September 1st 2006, 10:26 AM
wizard.gif
Chrispy
Peasant He/Him Canada
I'm a man, but I can change, if I have to.I guess. 
Prove it.
September 1st 2006, 10:55 AM
custom_magicman.gif
magicman
Peasant They/Them Netherlands duck
Mmmm, pizza. 
Behold, the source of evil.exe:

while (not.isEternalLoop ("evil.exe"))
do {}

A counterexample that proves not every program can be checked.
September 1st 2006, 04:44 PM
wizardb.gif
Phoenix
Peasant He/Him Norway
Back from the ashes 
Yeah. This was illustrated by a simple example to me the other day. If you have 8 nodes you can connect in every way possible, it would take a 1 GHz computer 2.3 years to write a list of all these, given it could actually also write one billion of these networks every second. Now, increase that network's size to 10 nodes, and it would take something like 39 billion years... and we're only talking a size of 10 here. Your brain consists of several billion cells, try getting a computer to list all the possible connections between all these.
September 1st 2006, 05:19 PM
custom_magicman.gif
magicman
Peasant They/Them Netherlands duck
Mmmm, pizza. 
The amount of connections with n nodes is 2^(n*(n-1)), assuming there can only be one or no connection at all between two nodes, and a node cannot directly be connected to itself.

Sorry, had to.
September 1st 2006, 10:47 PM
wizardb.gif
merlin
Peasant He/Him
 
I thought evil.exe was more like:

while(MSWindows.isRunning())
{
MSWindows.crash();
}

fork("evil.exe");

Or maybe that was the Windows source code...I can't remember.
September 1st 2006, 10:47 PM
wizardb.gif
merlin
Peasant He/Him
 
magicman FTW
September 1st 2006, 11:24 PM
death.gif
evil.exe was written by Bill Gates... he made sure it included the blue screen of death... now THAT really is evil.
September 2nd 2006, 12:49 PM
slimeb.gif
DaVince
Peasant He/Him Netherlands
Olde Time Dinkere 
Well duh, the MSWindows.crash() function runs BSOD(random) when it isn't running.
September 2nd 2006, 06:02 PM
custom_magicman.gif
magicman
Peasant They/Them Netherlands duck
Mmmm, pizza. 
I made a mistake, though... A really silly one.

It shouldn't be 2^(n*(n-1)), but 2^(n*(n-1)/2)

The full network of n nodes had n*(n-1)/2 connections. Every node (n total) connects to (n-1) others. However, we counted everything twice, so we divide by 2 (looked over that step... how easy is it to get lost of little details ). Now each of these connections can be "there" or "not there", offering a total of 2^(n*(n-1)/2) possible networks.

The recursive way is more fun to prove, altough much longer (but you still get 2^(n*(n-1)/2) as answer). I could show the recursive way, but that would just bore everyone away.

Since Phoenix' data of 2.3 years for 8 nodes and 39 billion years for 10 nodes fit with the incorrect formula (assuming 1 billion networks per second, 365 days per year), I didn't bother to double-check my derivation for errors. A square root of these results, which the /2 does, wouldn't fit his data. No, "you forgot leap year" is no explanation of an error this size.
September 2nd 2006, 11:42 PM
wizardb.gif
merlin
Peasant He/Him
 
magicman FTW again.
September 3rd 2006, 05:02 AM
wizardb.gif
Phoenix
Peasant He/Him Norway
Back from the ashes 
I forgot to make a very important precision. The connections are one-way, meaning a connection from a-b is not the same as one from b-a. So my formula still stands, once you're aware of this precision.
September 3rd 2006, 07:36 AM
custom_magicman.gif
magicman
Peasant They/Them Netherlands duck
Mmmm, pizza. 
When you allow both one-way connections to be "on" at the same time... I can live with that