In a momentary[0] insanity I came up with the concept of anti-golf.
Just looking for the largest solution wouldn't be fun. You can always
add dead code. Demanding that every op-code should be executed isn't
much better, then you just have to add ramdom not used calculations in
the code.
For a whi
Hello Hubert!
[EMAIL PROTECTED] (Hubert Depesz Lubaczewski) wrote:
> best as for now is:
> #!perl -l
>
> ($_=pop).=reverse;s/(.)./$1/g;print unpack"H*",reverse$_
> x1e4&(($q=pop)^~$q)^$q
Hello All!
[EMAIL PROTECTED] (Terje Kristensen) wrote:
> We started 2 new golfs yesterday, "Modular Fibonacci" and "Go golf".
>
> "Modular Fibonacci" : http://terje.dev.webon.net/golf/?12
> "Go golf" : http://terje.dev.webon.net/golf/?11
Both of golfs are over now, please submit your solutions.
On Sun, Oct 27, 2002 at 10:47:26AM +0100, Peter Makholm wrote:
> In a momentary[0] insanity I came up with the concept of anti-golf.
I'm not sure how far it's been thought through, but the concept has been
suggested to be called "perl bowling".
> Can anyone come up with a bounded measurement tha
In article <[EMAIL PROTECTED]>,
Peter Makholm <[EMAIL PROTECTED]> writes:
> In a momentary[0] insanity I came up with the concept of anti-golf.
>
> Just looking for the largest solution wouldn't be fun. You can always
> add dead code. Demanding that every op-code should be executed isn't
>
--- Ton Hospel <[EMAIL PROTECTED]> wrote:
> In article <[EMAIL PROTECTED]>,
> Peter Makholm <[EMAIL PROTECTED]> writes:
> > In a momentary[0] insanity I came up with the concept of anti-golf.
> Can't be done.
Yup.
> e.g. I can convert the program to a turing machine and run it on that.
> t
