If a tree falls (in c#)

[Fred Nerd]

Just a random, late night thought of a programming student.

I think I might be on the track of solving the age old problem of
"if a tree falls in the forest and no-one hears it, does it still make a sound"

I have considered it equal to:
"if something happens in my atempted program but there is no gui link, does it do what I wanted (and will use and later link)?"

When I work it out, then I will have solved both of them.


I also found out that is the answer os 42, the question is "How long is a piece of string?" Now to find out the units..... ( I need another drink)

Fred

[Ath]

I found the key:

a random, late night thought

[Renegade]

I also found out that is the answer os 42, the question is "How long is a piece of string?" Now to find out the units..... ( I need another drink)

1 error there... You need N more drinks. (And so do I~!)

[KynloStephen66515]

"How long is a piece of string?"

Twice as long as it is from the middle.

[Fred Nerd]

Actually, I have always found the length of a piece of string to be N-1 where n is the required length....
And my programming also comes up short

[Renegade]

Actually, I have always found the length of a piece of string to be N-1 where n is the required length....
And my programming also comes up short

And the solution to the N-1 string length problem is to have N+1 drinks~!

[Target]

Actually, I have always found the length of a piece of string to be N-1 where n is the required length....
And my programming also comes up short

And the solution to the N-1 string length problem is to have N+1 drinks~!

this is not a solution as the only output is 2X(N-1)

[Renegade]

this is not a solution as the only output is 2X(N-1)

However, the wonderful side effect when N > 10 is that you just don't care much anymore.

[Fred Nerd]

If N>10, then you have way too much string.
I think if I have had N+1 drinks I would get entangled in all of it. And then go from falling trees to 'string theory'

[Renegade]

If N>10, then you have way too much string.
I think if I have had N+1 drinks I would get entangled in all of it. And then go from falling trees to 'string theory'

Wait, if whenever you have string, and need N, you have N-1, then would that be N-1>10 or N>10-1?

As for string theory? That requires copious amounts of LSD, not alcohol.

Speaking of... I hear N[4 or 7] calling me now...

[Fred Nerd]

Remember we had N-1 string * N+1 drinks, making a grand total of 2N-1 (drinks/string whatever) So if N > 10, then we have almost double the string, and way too much to drink.

Remember not to do calculus when drinking though: don't drink and derive :p

[Target]

Remember we had N-1 string * N+1 drinks, making a grand total of 2N-1 (drinks/string whatever) So if N > 10, then we have almost double the string, and way too much to drink.

Remember not to do calculus when drinking though: don't drink and derive :p

I'm a bit confused - I've been following the process and all I ended up with was zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz

[Renegade]

Remember we had N-1 string * N+1 drinks, making a grand total of 2N-1 (drinks/string whatever) So if N > 10, then we have almost double the string, and way too much to drink.

Remember not to do calculus when drinking though: don't drink and derive :p

Hahahahahaha~!

I'm a bit confused - I've been following the process and all I ended up with was zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz

Who's the lush?