You are currently browsing the category archive for the ‘Amusements’ category.

**[ko̞ no̞ mi t̠͡ɕi]**

CUZ I DONT DO REVIEWS YO

this is a DIALOGUE on the nature of computation brought to you by °C-ute or actually just THE AIRI AND MAIMI SHOW cuz everybody else is like wut im a computer n00b i dont even know how to type zomgwtf but AIRI AND MAIMI are like SUPER FREAKING GENIUSES or something and they totally know everything about computers and programming and data structures and algorithms and complexity theory and all that

because contrary to popular belief °C-ute is actually short for

**°COMPUTE**

thats right THATS A DASH your supposed to fill in the missing letters duh

(betcha didnt know that huh?)

WUT

oh hay look its °C-ute in the middle of their STRUCTURE AND INTERPRETATION OF COMPUTER PROGRAMS class and today their going over HIGHER ORDER PROCEDURES and how to call a procedure using another procedure as an argument or even reflexively using the procedure itself

so erika and mai are like WUUUHHHHHH???? but airi and maimi totally know wuts going on cuz their like **SUPER FREAKING GENIUSES** and their already jumping ahead to next weeks topic…..

and airi goes hey check this out zomglolololololol

… one level of embedding …

….. TWO levels of embedding …..

……. FOUR LEVELS OF EMBEDDING ……..

……… **EIGHT LEVELS OF EMBEDDING** IS THAT AMAZING OR WUT OMG???!!! ………

XDDDDDDDDDDDDDDDDDDDDDD

and maimis like WUT

and airis like **RECURSION** B****ES!!!

but maimis like STFU N00B that terminates after only eight iterations

betcha cant do an **infinite loop** wut

so airi sez OH YEAH WELL CHECK THIS OUT

(define (FOREVER x) (display x) (FOREVER x)) (FOREVER "LOVE ")

SEE IT PRINTS OUT **LOVE** AND RECURSIVELY CALLS ITSELF SO IT CAN PRINT OUT **LOVE** AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN AND AGAIN

its like **LOVE** …….. FOREVER!!!!!

**wut**

**FOREVER LOVE**

get it? GET IT??!!!

but maimis like SRSLY zomgrofl **THAT IS SO TRIVIAL IT MAKES THE TRIVIAL GROUP LOOK NONCOMMUTATIVE** lol

NONCOMMUTATIVE?????!!!!!!!

I **OWN** TSUUGAKU VECTOR☂

**I AM THE LIVING EMBODIMENT OF THE INNER PRODUCT OF ANY TWO VECTORS IN A HILBERT SPACE**

cuz thats like **CONJUGATE SYMMETRY**

which when restricted to a real scalar field means that under the inner product any two vectors **COMMUTE**

FOR REAL

oh yeah well thats nothing compared to the **Y COMBINATOR**

(lambda (f) ((lambda (x) (f (lambda (y) ((x x) y)))) (lambda (x) (f (lambda (y) ((x x) y))))))

your procedure is so weak it needs a name zomglol

WITH THE Y COMBINATOR YOU CAN DO **ANONYMOUS RECURSION** ZOMGAWESOME

(((lambda (f) ((lambda (x) (f (lambda (y) ((x x) y)))) (lambda (x) (f (lambda (y) ((x x) y)))))) (lambda (p) (lambda (s) (display s) (p s)))) "LOVE ")

LOOK NO NAMES WUT

………………… O__________________O ……………………

THATS RIGHT THE Y COMBINATOR IS SHORT FOR **YAJIMA COMBINATOR!!!!!!**

o rly?

YA RLY **LAMBDA CALCULUS** FTW

well lambda calculus is ok but….

**KAPPA CALCULUS** IS THE BEST!!!!!! =(^w^)=

and maimis like *facepalm*

but then saki butts in and is like

i like **SKI calculus** cuz its like SAKI but like without the A

and airi and maimi are like LOLWUT

**NEXT TIME ON THE AIRI AND MAIMI SHOW FEATURING °C-UTE**

WTFAWESOME **BATTLE OF THE BRAINZ** LIKE ZOMG

**SUPER FREAKING GENIUS** IDOLS DISCUSS COMBINATORY LOGIC AND FORMAL GRAMMARS AND THE CHOMSKY HIERARCHY AND THE COMPUTATIONAL EQUIVALENCE OF RECURSION AND TURING MACHINES!!!!!!

and °C-ute perform **AN INTERPRETIVE DANCE** interpreting THE RUNTIME EXECUTION OF A SCHEME INTERPRETER INTERPRETING ITS OWN SOURCE CODE

LOLWUT kthxbai <33333333 XD

… I’ve just been busy, sorry.

Busy with what, you ask?

Well … I’ve been living it up (?) as a graduate teaching assistant for a course in mathematics for computer science, taken mostly by second-year undergrads, with a total enrollment of around ~180. As part of my duties, I get to teach two sections that meet twice a week and also contribute to writing problems for assignments and quizzes. What fun!

Actually, the making-up-awesome-problems part really is fun! I managed to whip together an entire problem set on the topic of sums and asymptotic relations in which all the problems are Hello! Project-themed.

Alas, after discussion with the other staff members, we decided that while the problems were awesome and hilarious (maybe more so for me than for them), they were a bit on the challenging side, not straightforward enough, and touched on a few topics we weren’t really covering (Problem 4d in particular “would kill the students”). So it got scratched, and a more boring replacement was released instead.

But all is not lost! We’ve decided to release this problem set as optional, not-for-credit “challenge problems”, and you can try them out here:

Hello! Project Challenge Problems (PDF)

If you wish, you can send your solutions to kirarinsnow@mit.edu, and I’ll respond with comments.

Enjoy!

Just for fun, and because Goto Maki’s name makes a great programming pun, here’s a function in C/C++ that uses Goto’s name to actually do something (it computes the factorial of a number; the **goto maki** statement makes the program loop over the individual multiplications until the final product is computed):

int factorial(int n) { int p = 1; maki: if (n == 0) { return p; } else { p *= n; n--;goto maki; } }

You can put this in, say, a C++ program like the following:

**gotomaki.cc**

#include

using namespace std;

int factorial(int);

int main()

{

int n;

cout << "Enter a nonnegative integer to factorialize: ";
cin >> n;

cout << "The factorial of " << n << " is " << factorial(n) << ".\n" << endl;
return 0;
}
int factorial(int n)
{
int p = 1;
maki:
if (n == 0)
{
return p;
}
else
{
p *= n;
n--;
goto maki;
}
}
[/sourcecode]
and then you too (yes, you!) can factorialize away with Gocchin:

% g++ gotomaki.cc -o gotomaki % ./gotomaki Enter a nonnegative integer to factorialize: 1 The factorial of 1 is 1. % ./gotomaki Enter a nonnegative integer to factorialize: 2 The factorial of 2 is 2. % ./gotomaki Enter a nonnegative integer to factorialize: 3 The factorial of 3 is 6. % ./gotomaki Enter a nonnegative integer to factorialize: 4 The factorial of 4 is 24. % ./gotomaki Enter a nonnegative integer to factorialize: 5 The factorial of 5 is 120. % ./gotomaki Enter a nonnegative integer to factorialize: 6 The factorial of 6 is 720. % ./gotomaki Enter a nonnegative integer to factorialize: 0 The factorial of 0 is 1.

Fun, ne?

C-ute’s new single, “LA LA LA Shiawase no Uta”, has a lot of *la*‘s, including an amazingly long ending sequence of **124** *la*‘s, as maiZe noted not too long ago. While this song no doubt contains more *la*‘s than any other Hello! Project release to date, it turns out that it does **not** have the longest sequence of consecutive *la*‘s. Any preliminary guesses as to what song holds that title? :-o

So, stricken as I was with curiosity, I wondered what other long sequences of *la*‘s there are, and Googling through ProjectHello, I put together a list of the fifteen longest *la* sequences, not counting those that appear within songs containing even longer *la* sequences. Not that all those other nonsense syllables out there are insignificant, of course, but *la* seems to be the most common, by a landslide.

I now present the 15 longest *la* sequences in the Hello! Project library, or at least those I could find, as I have no intention of checking to see if I’ve missed anything. In video format even! Now you can listen along for an entire whopping six and a half minutes of nonstop *la*-ness (to improve the flow, I cut out some of the fadeout sections, so not all the *la*‘s are there, but there are still close to a thousand left). Here they are from shortest (19 *la*‘s) to longest (136 *la*‘s). Some of them contain other utterances besides *la*, but they’re not part of the main melody, so I don’t consider them to be interrupting the flow of *la*‘s. If you’re still breathing when it’s over, you’re better off than I am.

As I’ve mentioned elsewhere, while I love compiling rankings of works released by Hello! Project, I refuse to give a subjective ranking of individual people, for various reasons. But Paul Thomas’s new poll is just so shiny I couldn’t resist…

So here is my **objective** ranking of Morning Musume, Berryz Koubou, and ºC-ute, using criteria that (I assume) no fan actually uses, consciously or not, to determine their favorites, though the near-perfect (except Kamei) spectral order of MoMusu is rather interesting and makes me suspect someone on the inside might be using a similar criterion to assign costume colors…

Sure, it might be a coincidence, but really, the probability of at least *n – 1* out of *n* elements randomly appearing in a specified order is .* In MoMusu’s case, *n = 9*, so the odds are about 1 in 5582.77. Hmm…

* I leave the proof of this formula as an exercise for the reader.

## Recent Comments