Questionnaire

[161803]

Labeling is sometimes mean, sometimes kind, sometimes useful, sometimes not.

Whatever.

Here is a questionaire:

Comparative Signal Processing

If you have 10 minutes and some curiosity about what you see there, then give it a shot.

Afterwards, if you feel like it, please
email me -- or leave a comment here if you don't mind others seeing

Comments

[slut_nugget]

i got an 85. i toads thought it would be higher, cause im "hypersensative" to everything on the questionaire...

also: i hope you had a nice lunch with your brother yesterday.

[161803]

It must be pretty torturous for you to spend so much time in the computer labs... the combo of lighting, smells(plastic and unwashed programmer), textures of the chairs, hard surfaces, whirring of fans and hard drives, etc. ... Urdu is a beautiful-sounding language by itself, but when it is overlayed with Minnesotan and Russian and the domain of discussion has no emotional content, the waveforms makes my bones hurt. Hindi, which sounds like a modem signal when spoken by techie males, actually fits in.

Thanks. My brother is from the same planet as me, and our respective continents have easy communication lines laid down, so it's almost always fun to get stupid with him at the P.O.

Thanks for giving the questionnaire a shot. Now be kind to yourself and get some decent headphones and a soft sweatshirt to dissolve into.

[sublunarman]

138, apparently in comparison to "the normal neuro-typical joe" i possess aspie qualities. This joe probably voted for Bush too, and maybe likes to take his kids to the mall

[161803]

Yes, Joe's behavior and predilections can be problematic at times

[sublunarman]

Are you going to coachella this year?
did you listen to the tape gigi talking? he became very broken up at times
Ive never heard of the C. twins, I will download some of their tunes

Regarding Flower Petal Problem

[androgy8]

Simple mathematical solution:
For each 3, add 2 to the total sum. For each 5, add 4.

Or you could get into a more generic algorithm:
Let s = total sum. For each die number (n):
If n is odd and n does not equal 1, add n-1 to s.
If n is even or if n equals 1, add 0 to s.

Re: Regarding Flower Petal Problem

[androgy8]

I realized after posting the previous post that the second paragraph can be simplified further. The algorithm boils down to:
For each n: If n is odd, add n-1 to s. If n is even, don't add anything.

Re: Regarding Flower Petal Problem

[161803]

cool. thanks!