Note that this image isn't IE8-friendly for some reason. If it's choppy and slow, that's why.

#include <stdio.h>
int main()
{
while (1) {
puts("Hakase da nyan!");
puts("Moe desu!");
}
}

#include <stdio.h>
#include <Windows.h>

int main()
{
while (1) {
puts("Hakase da nyan!");
Sleep(1000);
puts("Moe desu!");
Sleep(1000);
}
}

while true
puts "Hakase da nyan!";
sleep 1;
puts "Moe desu!";
sleep 1;
end

function Nyaaaaan() {
alert("Hakase da nyan");
alert("Moe desu!");
Nyaaaaan(Nyaaaaan());
}
Nyaaaaan();

Because giving the user a chance to escape is inferior.

The problem with recursion is that you'll stackdump if you don't unravel at some point.

Griffinhart said:
The problem with recursion is that you'll stackdump if you don't unravel at some point.

The other examples in this thread aren't recursions, but infinite loops. Mine is a fork-bomb, which is made to fuck the machine, anyway.