00:12:21 can't you funcall with infinite number of parameters by using a cyclic list? 00:12:55 oerjan: I tried (apply #'format t "..." infinite-list) 00:12:59 which didnt work 00:13:05 but I think you are rihgt 00:13:11 I could just call it without apply 00:13:16 may work, im not sure 00:13:28 depends on the behavior of ~? 00:13:37 (which im not totally sure about) 00:13:40 * fax tests 00:13:49 might be implementation-defined 00:16:11 even then i have a sense you get limited to a pushdown automaton since the positions in the formats and argument lists are your only changeable data that i can see 00:18:28 except, perhaps, if you use the extensible output string as your format string in some clever way... 00:20:45 something like Smith or Muriel 00:22:16 -!- crathman has joined. 00:22:48 -!- crathman has quit (Remote closed the connection). 00:39:40 * fax writes thhis (format nil "~{~^~?~}" '("<~?>" ("[~a]" ("y")))) → <[y]> 00:39:43 * fax gives up again 00:48:17 -!- ihope has joined. 01:07:44 j0 02:01:35 * pikhq has discovered that Gentoo provides an easy way to get GDC working. . . 02:01:47 Add "d" to USE, recompile GCC; voila. 03:42:45 -!- ihope has quit (Read error: 110 (Connection timed out)). 04:29:15 If you ever wondered how virtual methods worked, this paper has an excellent explanation, AFAICT: http://www.cs.ucsb.edu/~urs/oocsb/papers/oopsla96.pdf 04:55:55 -!- oerjan has quit ("leaving"). 05:32:19 virtual methods being ones that need to be defined in a subclass? 05:54:15 -!- puzzlet_ has quit (Read error: 104 (Connection reset by peer)). 06:03:45 -!- puzzlet has joined. 06:04:32 -!- puzzlet has quit (Client Quit). 06:05:18 -!- Arrogant has joined. 06:07:54 -!- puzzlet has joined. 06:12:56 -!- puzzlet_ has joined. 06:13:49 -!- puzzlet has quit (Read error: 104 (Connection reset by peer)). 06:45:11 -!- puzzlet_ has quit (Read error: 110 (Connection timed out)). 07:56:07 -!- Arrogant has quit ("Leaving"). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 10:07:51 -!- fax has quit (" "). 11:59:16 -!- ihope has joined. 12:36:20 -!- ihope_ has joined. 12:54:50 -!- ihope has quit (Read error: 110 (Connection timed out)). 12:58:19 -!- pikhq has quit (Read error: 110 (Connection timed out)). 14:28:00 -!- goban has quit (Read error: 104 (Connection reset by peer)). 14:48:00 -!- pikhq has joined. 14:50:23 -!- jix__ has joined. 15:22:15 -!- crathman has joined. 15:26:16 -!- helios24 has quit (Read error: 113 (No route to host)). 15:54:07 -!- jix__ has changed nick to jix. 16:15:52 -!- fax has joined. 16:15:53 hi 16:38:50 -!- sebbu has joined. 17:18:22 http://omg.worsethanfailure.com/ Anyone else going to work on this? 18:16:03 -!- Arrogant has joined. 18:45:10 -!- ihope_ has quit ("http://tunes.org/~nef/logs/esoteric/06.08.09"). 19:00:45 -!- Arrogant has quit (Read error: 113 (No route to host)). 19:21:36 contest: write a program to print the decimal representation of the 435 fibonacci number 19:22:00 mine is 35 characters 19:23:49 least characters wins 19:23:51 -!- helios24 has joined. 19:24:00 * fax tries 19:26:20 -!- jix has quit ("Bitte waehlen Sie eine Beerdigungnachricht"). 19:27:50 hm 19:28:11 hrm 19:28:11 [fbs=.2#1 19:28:18 then do [fbs=.,&fbs+/0 1{fbs 435 times 19:28:28 then take elemt 0 19:28:30 * fax tries 19:32:14 bsmntbombdood: whats the 8th fib number? 19:32:29 its 21 right? 19:33:05 yes 19:33:38 damn, i got 39 19:34:02 almost... 19:34:11 of course, you're probably using Perl :) 19:34:32 no, dc 19:34:43 oh 19:34:45 heh 19:34:55 dc might as well stand for "dense code" 19:35:21 39, hasekll: let f=0:1:zipWith(+)f(tail f)in f!!435 19:35:43 damn i I knew how to do somthing several times.. 19:35:51 0sa1sb435[ladlb+sasb1-d0 :D 19:36:09 tricky 19:36:41 whats that?! 19:40:18 fax: the program 19:40:41 what language 19:41:00 dc 19:41:44 -!- fax has changed nick to faux. 19:44:21 ugh I dont know J well enough to write this 19:45:01 oh maybe I know what to do 19:47:45 yes~ 19:47:48 i beat myself 19:48:25 33 chars 19:48:31 0sa1 435[rdla+rsar1-d0 I suck at J 19:55:01 0{((2 0{(,+/))^:(435-2))1 1 19:55:04 thats mine though 19:55:09 probably possible to make it shorter 19:55:17 the answer is 3.63194e90? 19:57:30 something like that. 20:03:01 faux, what's your language ? 20:03:18 J 20:03:35 but I dont really know J .. Its hard 20:36:39 -!- faux has changed nick to fax. 21:24:30 OK I told every other channel... I made a parody of http://www.linuxsoftware.co.nz/containerchoice.png ..... http://img410.imageshack.us/img410/5972/lispcontainerchoicelp9.gif 21:24:41 can you tell im bored? 21:39:39 Hahahah 21:54:47 Too many damned things I should work on. . . 21:55:09 I still want to try my hand at that Linux distro I've been thinking about. . . 21:58:28 pikhq: My improved Plof interpreter works now :) 21:58:44 GregorR: Speaking of which, I've now got a working D compiler. 21:58:50 Neato. 21:58:57 Yay, Gentoo! 21:58:58 Now all you need is Tango and DSSS, and you can compile it ;P 22:00:23 Could you please do me a favor and either remove that dependency or actually bother with the amd64 port you said you'd work on? 22:00:42 I can't really remove the dependency on Tango. 22:00:49 Well, maybe I could :P 22:02:13 So, I should work on getting myself a nice, shiny new distro instead. 22:02:38 ... or just compile with -m32? 22:02:45 . . . That'd be too easy. 22:02:50 :P 22:03:01 CC="gcc -m32". 22:03:04 Yeah; too easy. 22:05:05 Do you have 32-bit libs installed? 22:05:51 Yeah. 22:05:59 Just grab this binary: http://downloads.dsource.org/projects/tango/0.97/tango-0.97-forDSSS-gdc-i686-pc-linux-gnu-withDSSS-withGDC.sh 22:06:06 One step process ^^ 22:06:21 The 32-bit libc actually comes out of the box in Gentoo now. . . 22:06:29 That's either nifty or awful. 22:06:31 I don't know which. 22:06:39 It's just so that gcc -m32 works. 22:06:48 It's not *used* at all unless you install more packages. 22:06:58 Hrm. 22:07:21 (I *think* it's just for simplicity's sake; easier to get the libc package to do both than to have multiple packages which only need to be cared about for x86_64) 22:08:02 . . . Unless maybe busybox is linked against the 32 bit libs? 22:24:31 oh damn, i got beaten? 22:26:21 bsmntbombdood: by me? 22:26:32 "0{((2 0{(,+/))^:(435-2))1 1" ? 22:27:08 What language is that? 22:27:33 J 22:27:39 Im sure it could be done better though 22:27:43 Im not really any good at J 22:27:44 If we're allowed to use *any* language for that competition, then I can *surely* find something that'd win. 22:27:55 yeah Fibonacci++ :P 22:28:05 like HQ9 something something? 22:28:14 Turing complete, I'd assume. . . 22:28:23 BrainfuckFib. :p 22:28:47 using a builtin function is cheating 22:29:09 +++>++++>+++>+++++<< hehe 22:30:31 Now a Perl implementation would be interesting. . . 22:30:42 Probably get something like a large string of numbers. 22:30:42 wow 22:30:49 I bet you guys have seen this a million times 22:30:51 but incase you havent 22:30:57 http://montreal.pm.org/tech/neil_kandalgaonkar.shtml 22:31:05 primeality test regex 22:31:10 I thought that was great 22:31:15 Not surprised at all. 22:31:39 In such uses, Perl counts as an esolang. . . 22:31:46 Kind of like what IOCCC can be. 22:32:06 m(){n;f(h=1;h<=b;d=1);f(c=2;c<=b;c++)i(e){p("%i\n",c);f(h=c*c;h<=b;h+=c)g=0;}} 22:32:14 That's my personal example. 22:33:06 The list of defines on the command line is about as long as that code. . . 22:34:55 ah ha! 22:35:04 a one letter fib program, in C: 22:35:08 X 22:35:10 ?±! 22:35:13 what 22:35:22 X is defined as something else via -D. 22:35:29 right 22:35:33 -_- 22:35:34 -D "n=int a[b]" -D f=for -D p=printf -D m=main -D b=10000 -D "c=(a[1])" -D "d=a[h++]" -D e=a[c] -D g=a[h] -D "h=(*a)" -D i=if 22:35:35 thats cheating 22:35:43 There; the list of defines for my line of C. 22:35:51 you can use GCC as a brainfuck compiler like that 22:35:52 heh 22:36:06 It really doesn't get any better after preprocessing. . . 22:37:47 As proof: http://pikhq.nonlogic.org/bar.c 22:37:55 My line after preprocessing and indent. 22:38:50 First person to figure out what it does and how wins a prize. 22:40:07 :S 22:40:09 I have no idea 22:43:28 It's a prime number generator. 22:43:40 see i thought it might be 22:43:41 Now how, I leave as an exercise for the reader. 22:43:47 but then I thought.. no way 22:43:49 heh 22:43:52 (just name the algorithm) 22:44:19 fax: Why'd you think 'no way'? 22:46:00 no % anywhere! 22:46:15 Bah. 22:46:31 Who needs that operation? 22:46:43 And there *is* a %. . . In the printf call. 22:50:26 -!- pikhq has quit (Read error: 104 (Connection reset by peer)). 22:53:40 i don't understand it 22:53:59 -!- pikhq has joined. 23:03:04 -!- pikhq has quit ("leaving"). 23:03:21 -!- pikhq has joined. 23:07:07 -!- oerjan has joined. 23:26:32 i think there is an off by one error in the first for, for starters 23:27:14 -!- crathman has quit ("ChatZilla 0.9.78.1 [Firefox 2.0.0.3/2007030919]"). 23:30:27 -!- Sgeo has joined. 23:30:34 basically, i think all the <= 10000 should be < 10000 23:35:29 other than that it looks like an Erasthotenes's sieve 23:35:43 *Eratosthenes