I have written an ABC interpreter, and extended the language itself with such features as the spaceship operator or double the BUFFA.
Name:
Anonymous2009-04-13 14:57
double the BUFFA
I came
Name:
Anonymous2009-04-13 16:43
Jeez where do I even begin.
I authored the FIOC meme, My Other Car, tuna fish, Anal Touring, Touring Complete, Hax My Anus and a whole bunch of other memes. Memes which you use and take forgranted everyday.
ive been playing some 20000 light years - this dumb python game where you make steam for a city.
ive started to familiarize myself with the code to make it better - no seasons because they piss me off. i just want to make a beatiful steam network and not having aliens or disasters trying to fuck me anally every few minutes.
also higher city levels. in fact maybe not even end game on a city level, just let them get higher and higher.
also a scrolling screen because that is just tooo small.
also visual feedback for node/pipe tech levels so you dont have to U-click everywhere like a spas.
Have 25 commits to the Linux kernel and many personal projects.
Name:
Anonymous2009-04-13 20:19
Anonix
Name:
Anonymous2009-04-13 20:22
I have written a fully standards-compliant ABC compiler, with none of >>10‘s unnecessary bloat. I have also written a few anoncoreutils still in the distribution today.
I created the original /prog/snake and most of its derivatives.
I wrote the majority of the /prog/ stories.
I designed the initial plot and screens for the SICP VN.
I retypeset SICP and K&R.
I started Anonix and helped propagate forced_anon_chat.
I started the Satori meme and spread it to the other boards.
I am /prog/.
Name:
Anonymous2009-04-14 3:34
>>23
>I created the original /prog/snake and most of its derivatives.
I wrote the majority of the /prog/ stories.
I did these two, I don't know about the others though.
A series of encryption algorithms. They can be viewed at my blog.
Right now i'm coding a novel compression algorithm.
Name:
Anonymous2009-04-14 16:19
I learned what compiler is and why I use it to make my program clickable.
Name:
Anonymous2009-04-14 16:23
>>30
Remember that for it to be fully usable in a conventional manner you need to implement an algorithm for uncompressing as well.
And any data loss is, unfortunately, unacceptable.
I only program Fibonacci and puzzle solvers in Haskell, Python, Prolog.
However I have 102 commits in a 34kc Harry Potter × Babylon 5 crossover slash in Belorussian.
Name:
Anonymous2009-04-14 22:59
>>1
I never done good things
I never done bad things
I never did anything out of the blue, woh-o-oh
Name:
Anonymous2009-04-14 23:35
I created the ``cleft labia'' meme
Name:
Anonymous2009-04-14 23:56
>>35
I bet my Fibonacci is faster than yours.
And by faster, I mean O(log n) vs. O(n) faster.
>>42
It should be trivial to implement it in O(1) using memoization, however this would mean high RAM usage. And one can use a hybrid approach which requires very little RAM(constant), where only the last 2 values of fibs are stored and passed recursively(tail-recursive, so can be implemented as iteration too). The hybrid approach has one disadvantage to the memoization version, as the first should be able to instantly return a previously calculated fibs, while the hybrid one actually recalculates fibs each time.
Fibs discussion is the height of /prog/ achievements. Continue.
Name:
Anonymous2009-04-15 2:39
O(1) fibonacci is only possible for fixed-size integers. and it's slow as fuck unless that size is extremely small (much smaller than you'd need for fib 100000000). so it's actually completely useless.
(*let fibs n =
let rec fibq fkm1 fkm2 k n =
if (n<2) then (if (n=0) then 0 else 1)
else if (n=k) then (fkm1+fkm2)
else fibq (fkm1+fkm2) fkm1 (k+1) n
in fibq 1 0 2 n*)
(*#load "nums.cma";;*)
open Big_int;;
let fibs_big n =
let rec fibq fkm1 fkm2 k n =
if (n<2) then (if (n=0) then big_int_of_int(0) else big_int_of_int(1))
else if (n=k) then (add_big_int fkm1 fkm2)
else fibq (add_big_int fkm1 fkm2) fkm1 (k+1) n
in fibq (big_int_of_int(1)) (big_int_of_int(0)) 2 n;;
let f10_8 = string_of_big_int (fibs_big 1000000);;
print_endline f10_8;
flush stdout
It actually runs in a reasonable amount of time, but something like 10**10 is very slow due to the amount of memory needed to represents the bignums as >>50 stated