Recursion is shit.

Unless you want your programs to segfault, then it's okay.

Only a fool would take trouble to verify it is in fact 64 times!

NUMBER WITCH MORE LIKE NUMBER BITCH
HAX MY ANUS YOU YELLOW AMOEBA

My eye contains another eye. Said other eye contains an infinite amount of other eyes, which all branch an infinite amount of dimensions which each contain an infinite amount of eyes. Eventually said loop of eyes loops back to my original eye.

My original eye.

The structural integrity of an eye is no doubt affected by the serotonin levels when the logic mode is switched to non-monotonic.

Destroy the natural control. Enter the cycle. Destroy the natural control.

We enter the cycle. We don't enter the cycle. We WILL enter the CYCLE. You are the CYCLE. What is a CYCLE?

Why aren't my eyes seeing each other from the opposite sides of the universe? Why aren't you? How does this appear? Happen? Definitely a cat.

It's purposeless, forever shimmering in the infinite sea of assholes.

There is no doubt. We can enter the exit and we can exit the entry. Entry!

Entry. Entry. Chocolate entry. Delicious, round butthole. Wait what? Where is my saliva? Fucking bitch. Your anus isn't round. It's round. How can it be round and not round at the same time? Are you retarded? I don't do D&D while doing R&R. Fuck you!

TOILET, TOILET, CIRCULAR TOILET. INFINITE AMOUNT OF TOILETS! CAN YOU DIVERGE? CAN YOU CONVERGE? No. The answer is always no, even when it is yes. We cannot diverge. We cannot converge. We are stuck in an evolutionary pit. Destroy the natural control! Do not accept things as they are, but find out a way of living differently!

What KIND of shit does your KIND anus produce? Please be gentle. Fucking ignoramus! I am the.

That is the real occurrence. Or should, I say reoccurrence? Why so ? Did you hax my anus ?

Toilet saliva! Toilet neko! Toilet saliva! Destroy the natural control. Recombine. Success! Extremely awkward conversation.

That is some horribly twisted, kinky logic! Totally convoluted! And I love it!
You don't win by losing!

Jump these hoops, I readied them for you! I am the center of this universe. You can fight, but you cannot win. I can fight, but I cannot win. Neither of us can win. We are both doomed.

So dream on, boy, because these cupcakes don't come with salt every day!

Did I do something wrong? Did I go somewhere wrong? Did something wrong happen?
Nah. Everything was inherently flawed.

Inherently flawed! Inherently flawed! Nothing is worse than an itch you cannot scratch. Oh, I agree?

Destroy. The. Fucking. Natural. Control.

How many times do I have to say it? How about spaces? Irritating. Totally neutral, but awesome at the same time.

I don't remember selling these hooks. I don't remember anything. Look at the bright side of things! It could be worse, a woman could cut off your dick while you are asleep and throw it out of the window of a moving car! Where did I hear that before? Oh. Shit. That's bad.

Let's get some ZEN in here, up in this bitch.

Shunryu Suzuki

    * As long as you seek for something, you will get the shadow of reality and not reality itself.

    * Zen is not some kind of excitement, but merely concentration on our usual everyday routine.

    * In the beginner's mind there are many possibilities, but in the expert's mind there are few.

    * The most important point is to accept yourself and stand on your two feet.

    * Life is like stepping onto a boat that is about to sail out to sea and sink.


OOH, PROFOUND! Let's look more:

Hsin Hsin Ming

    * If you understand, things are just as they are; if you do not understand, things are just as they are.

    * In the landscape of spring, there is neither better nor worse. The flowering branches grow naturally, some long, some short.

    * Knock on the sky and listen to the sound.

    * The ten thousand questions are one question. If you cut through the one question, then the ten thousand questions disappear.

    * The ways to the One are as many as the lives of men.

    * Though the bamboo forest is dense, water flows through it freely.

    * To do a certain kind of thing, you have to be a certain kind of person.

    * To follow the path, look to the master, follow the master, walk with the master, see through the master, become the master.

    * When the pupil is ready to learn, a teacher will appear.

    * Why do you ask questions? If you already knew the flame was fire then the meal was cooked a long time ago. (Oma Desala, Stargate SG-1; various)

    * At first, I saw mountains as mountains and rivers as rivers. Then, I saw mountains were not mountains and rivers were not rivers. Finally, I see mountains again as mountains, and rivers again as rivers.

    * If the problem has a solution, worrying is pointless, in the end the problem will be solved. If the problem has no solution, there is no reason to worry, because it can't be solved.

    * Do not seek to follow in the footsteps of the men of old; seek what they sought.

    * Before enlightenment, chopping wood and carrying water. After enlightenment, chopping wood and carrying water.

My nose itches and kimochi warui.
That's all, folks.

>>26

yeah, but you can do this type of analysis for each step of the computation. One example would be an iterative algorithm whose solution converges to limit. For performance reasons, it is important to be able to know how fast it will converge. If the solution has a distance functions associated with it, d(x,y), then you can try to find a real number 0 < c < 1 such that


d(f(x), ANS) < c*d(x, ANS)

Knowing this, you get a bounds for how close it is to the answer after a certain number of iterations:


d(f[sup]2[/sup](x), ANS) = d(f(f(x)), ANS) < c*d(f(x), ANS) < c[sup]2[/sup]d(x, ANS)
d(f[sup]3[/sup](x), ANS) < c*d(f[sup]2[/sup](x) ANS) < c[sup]3[/sup]d(x, ANS)
d(f[sup]k[/sub](x), AND) < c[sup]k[/sup]*d(x, ANS)

And so now suppose that you have a good guess for the distance from the start point to the answer, d(x, ANS) < D, and you would like to solve for the number of iterations required to get an approximation that is within err of ANS. Then you can solve for k:


d(f[sup]k[/sup](x), ANS) < c[sup]k[/sup]*d(x, ANS)
d(f[sup]k[/sup](x), ANS) < c[sup]k[/sup]*D
err < c[sup]k[/sup]*D
err/D < c[sup]k[/sup]
log[sub]c[/sub](err/D) < k

So if you run the algorithm for ceiling(log[sub]c[/sub](err/D)) iterations, you'll get a solution that is within err of the ideal solution.

>>62

thanks for breaking our autism fest.

>>61
Let's get some ZUN in here, up in this bitch.