00:00:16 AH! Run away, run away! 00:00:42 * RodgerTheGreat backs away nervously 00:01:09 * oerjan regrets participating in the creation of a monster. 00:01:47 agreed 00:02:16 hm? 00:04:03 the results of the last Adjudicated Blind Collaborative Design Esoteric Factory run are a horrible monstrosity. 00:04:16 Why? 00:04:21 What's wrong with it? 00:04:46 And it's not been made, thus the Adjucated Blind Collaborative Design Esoteric Factory run isn't done. 00:06:00 * Sgeo wishes he did variables in branch labels and allowed 0 in the CHANGE(?) thingy 00:19:57 My language has room for five more instructions. 00:20:32 I thought it would fit quite easily into 63, but already I have 58, and I might need more later. 00:20:47 63? 00:20:49 Oh, wait, 64 would be the maximum. 00:20:52 strange num.. oh 00:21:22 7 * 9 = 63, no? 00:22:41 * Sgeo generally likes and recognizes numbers of the form (2^n±.5) 00:22:44 erm 00:22:48 No 00:23:05 * Sgeo generally likes and recognizes numbers of the form (2^n-.5±.5) 00:23:21 =P 00:23:43 Where n is a positive integer ofc 00:23:44 So six more instructions. 00:23:55 have you added peekaboo yet? :) 00:23:56 Not a nonnegative integer? 00:24:13 My language doesn't exactly have booleans. 00:24:53 Branch On something, then. 00:24:56 And peekaboo would require peekbboo, peektboo, peekbaboo, peekbbboo, and peekbtboo. 00:25:15 there you are, 6 instructions. 00:25:24 Yep, that'd fill it up quite nicely. 00:25:30 But... branch on what? 00:25:41 overflow, perhaps... 00:25:50 odd.. 00:25:56 "Peek stack a; branch on overflow"? 00:26:14 Would the stack overflow from being peeked? 00:26:55 probably not. 00:27:31 And most peekaboos wouldn't make sense without popaboos. 00:27:39 And possibly pushaboos. 00:28:05 * ihope suddenly decides he needs stack rotation 00:28:22 actually, another option is to make aboo similar to a, b etc. 00:28:52 "Peekaboo" meaning "peek both A and B"? 00:29:10 that's not what i mean but that could be neat too. 00:29:23 What do you mean, then? 00:29:39 i mean, then you could have popaboo and pushaboo but not need peekbboo etc. 00:30:06 if aboo was a stack 00:30:17 aboo isn't a stack. 00:30:30 well, whatever a, b etc. are 00:30:30 There are three stacks, and they're called A, B, and T. 00:31:12 And... well, I just added six stack rotation instructions. 00:31:31 * oerjan sulks. 00:31:45 YOUR LANGUAGE IS NO FUN! 00:31:59 But it has the "select" instruction from INTERCAL! 00:32:45 And it has an instruction whose purpose is to be left up to the implementation to... implement! 00:33:18 It's the "info" instruction, and it means "push a zero, then push some numbers that aren't zero". 00:34:05 And... there should be six of that, too, since every stack operation needs to have six instructions. 00:34:12 * ihope makes the total 69 instructions 00:35:04 Okay, let's increase the cap to 128 instructions. 00:35:31 you suddenly lost a bit for other purposes. 00:35:32 And leave out the poor little 6-bit computers. 00:35:51 It's your fault I have so many instructions, despite the fact I came up with all of them myself! 00:36:27 you could make it 81 instructions on a trinary machine. 00:36:42 But the instructions aren't ternary. 00:36:57 How do you do a ternary nor? 00:37:24 Or any ternary not, I guess. 00:37:32 3-min(a,b) 00:37:45 2-min(a,b) 00:37:49 * ihope realizes he has no "not" instruction 00:37:57 Also, negative numbers. 00:38:15 negative numbers are easy if you make your trits -1,0,1. 00:38:28 Oh, yeah. Balanced ternary. 00:39:27 or should that be terts? 00:39:41 Are they terse? 00:39:44 -!- tgwizard has quit (Remote closed the connection). 00:40:02 trits! 00:40:21 Bits! 00:40:45 quints! 00:41:01 Sets? 00:41:07 I'm not sure there is a ternary not 00:41:33 ternary linc? 00:41:37 Any unary tritwise operator could be considered one, other than identity. 00:41:39 like how XOR splits into ^ and ? 00:41:43 (looping increase)? 00:41:57 actually not should be an involution. 00:42:03 involution? 00:42:08 not not = identity. 00:42:38 Oh, yeah. 00:42:43 * Sgeo thinks that that might be actually impossible in ternary 00:42:49 Any swap, then. 00:43:01 012 -> 102, 012 -> 210, 012 -> 021. 00:43:01 not 0 => 1, means not 1=>0 00:43:07 on the other hand, if you also add the requirement not x != x, then indeed it is impossible. 00:43:07 So what happens to not -1? 00:43:12 that sounds like unary but 00:43:18 Unary, pah. 00:43:55 Real (Wom|M)en ignore the leading zeros in unary. 00:44:01 with balanced ternary, not = negation seems the obvious canditate. 00:44:15 Aye. 00:44:18 * Sgeo agrees 00:44:32 one of my favourite quotes from the intercal manual involves balanced ternary 00:45:26 * oerjan is listening. 00:49:57 http://pastie.caboo.se/21233 00:50:03 (that took far too long to find) 00:58:51 * oerjan is probably immune to such head banging. 01:00:12 * pikhq recently discovered a major bug in BFM. . . 01:00:21 aha 01:00:23 It didn't have a 99 Bottles of Beer implementation. 01:00:46 that counts as a bug these days? 01:01:01 -!- meatmanek has quit (Client Quit). 01:01:02 lmao 01:01:06 Closest I can find at the moment. 01:01:20 http://pikhq.nonlogic.org/bottles.bfm So, I fixed it. 01:26:00 I guess I oughta come up with all the semantics of this language. 01:28:13 -!- meatmanek has joined. 01:32:52 I've now managed to get wrapping working (in my first test) in my befunge98 interpreter :D 01:33:22 I still don't understand how these intersection functions I wrote work, because of the 101 corner cases I didn't expect, but it seems to be working! 01:50:01 -!- calamari has quit ("Leaving"). 01:51:00 If you write code and it works, but you don't know why it works, you should consider rewriting it. 01:51:44 Or do as Perl does, and declare it to be magic. 01:53:02 I know why it works, it's just I had to change it so many times to get it to work that it's quite different from the code I started out with and many of the function names are.. wrong somewhat 01:53:22 * Sgeo has some code with some "code superstition" somewhere 01:53:28 * Sgeo thinks he removed that stuff :( 01:53:43 No I didn't 01:53:57 " #The code doesn't seem to work without these lines 01:53:57 #This is how code superstition starts.. 01:53:57 #Instead of crashing on start, these lines make it crash on select 01:53:57 #def on_TextField1_loseFocus(self, event):" 01:54:22 http://sgeo.diagonalfish.net/haver/pycardhaver/templateNoMenus.py.txt 01:58:03 -!- meatmanek has quit (Client Quit). 02:00:08 -!- meatmanek has joined. 02:01:25 -!- meatmanek has quit (Client Quit). 02:02:43 -!- meatmanek has joined. 02:03:08 -!- meatmanek has quit (Client Quit). 02:04:13 -!- meatmanek has joined. 02:09:42 -!- oerjan has quit ("Later"). 02:17:08 ! 02:17:23 That's 33, right? 02:22:03 -!- calamari has joined. 02:35:55 -!- oerjan has joined. 02:41:05 -!- Asztal has quit (Read error: 110 (Connection timed out)). 02:41:26 http://thedailywtf.com/forums/thread/99550.aspx 03:03:58 * rt yawns. 03:04:41 I should write a book called The Art of Obfuscation. 03:06:57 http://brainwagon.org/files/jhconway.c 03:08:01 I turned def __len__(self): return len(self.sugTags) 03:08:03 into 03:08:12 locals()[lambda("self")].__dict__[lambda: "__class__"()].__dict__[lambda: "".join(dict("lol":"__len__").values())()] = lambda self: tuple(self.__dict__[lambda: "subTags"()].__dict__.[lambda: "__class__"()].__dict__[lambda: "".join(list("".join(list("__len__"))))()].__call__.__call__.__call__.__call__(), self.__dict__[lambda: "".join(list("".join(dict("hahahahahaahahahahahahahaahhahahahaahahahahaha 03:08:13 ha":"values").values()))))()].__dict__.[lambda: "__class__"()].__dict__[lambda "".join(list("".join(list("__len__"))))()].__call__.__call__.__call__.__call__()) 03:08:29 Although I could have went further... but I got tired. 03:10:29 strangely enough, i dont find that particualrly artful. 03:13:16 lol wtf is that? 03:18:17 hey, it looks like something a chimp could have typed ;) 03:21:08 * Sgeo pokes people towards the WTF he posted 03:22:23 * xor_ reads it 03:24:39 lol 03:25:30 It looks like art to me. 04:02:44 Hibernate, hibernate, hibernate, they say... 04:20:40 -!- ihope has quit (Connection timed out). 05:10:47 -!- thematrixeatsyou has joined. 05:11:13 -!- Arrogant has joined. 05:13:01 -!- SevenInchBread has changed nick to GrandmotherChaos. 05:13:04 hi arrogant 05:13:12 Heya. 05:13:25 gonna try and slap a FAT driver together 05:16:51 should call it PHAT 05:21:36 te he he 05:22:06 x=[1]; x.append(x) 05:33:25 * GrandmotherChaos doesn't get it. 05:36:29 -!- Sgeo has quit (Read error: 104 (Connection reset by peer)). 05:36:46 cirular reference 05:37:15 kinda like this: 05:37:58 *x=1; while(*x){ *x[0]=*x[1]; x++; } 05:38:26 no 05:39:02 in C it would take an infinite amount of memory 05:39:16 It'd just eventually segfault. 05:39:32 [1,[1,[...]]] 05:39:47 x=[1,x] 05:39:54 k 05:40:24 append x $x 1 05:40:44 while(int i) 05:44:18 -!- Razor-X has quit (Read error: 110 (Connection timed out)). 05:44:36 hmmm 05:44:49 What would make that list in lisp? 05:46:07 (list x '(x 1))? 05:46:20 actually, in c, it would be int x[2]; x[0]=1; x[1]=x; 05:46:26 er no 05:48:12 you mean (let ((x '(1))) (rplacd x x) x) 05:48:18 or something like that. 05:48:21 I'm no Lisper. 05:48:34 I'm a Tcler, as you all should know. . . 05:49:01 [lappend x $x 1] gives you the same list in Tcl, BTW. 05:49:40 haskell _would_ be x = [1,x] except that is a type error. 05:50:31 x = [1] ++ x works nicely though. 05:52:09 -!- calamari has quit ("Leaving"). 06:07:07 afk pizza 06:51:36 -!- Razor-X has joined. 07:35:25 -!- GrandmotherChaos has changed nick to CakeProphe. 07:35:27 -!- CakeProphe has changed nick to CakeProphet. 07:47:51 back 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:34:36 -!- thematrixeatsyou has quit ("buy"). 08:47:15 -!- oerjan has quit ("Good, eh, night"). 09:38:08 -!- anders has left (?). 09:50:18 -!- CakeProphet has quit (Read error: 110 (Connection timed out)). 09:57:45 -!- Arrogant has quit ("Leaving"). 10:29:47 -!- Asztal has joined. 10:47:17 -!- GregorR has joined. 11:48:30 -!- tgwizard has joined. 12:41:43 -!- Asztal has quit (Nick collision from services.). 12:41:53 -!- Azstal has joined. 12:41:55 -!- Azstal has changed nick to Asztal. 13:30:34 -!- ihope__ has joined. 13:30:44 -!- ihope__ has changed nick to ihope. 13:57:19 Eh, I'll just email this interpreter to a random person. 14:04:15 Actually, I have some FTP thing somewhere, don't I? 14:06:44 Apparently not. 14:12:33 Well, yes, but I don't remember where. 14:12:48 So I have three email addresses. 14:18:00 -!- ihope__ has joined. 14:19:12 As in in this file, there are three email addresses. 14:20:55 -!- Asztal has quit ("Chatzilla 0.9.72-rdmsoft [XULRunner 1.8.1b2/0000000000]"). 14:24:28 -!- CXI has joined. 14:34:15 -!- ihope has quit (Success). 14:48:32 -!- ihope__ has changed nick to ihope. 15:14:07 -!- Sph1nx has joined. 15:21:33 What happened to the committee meeting, t3h committee members? 15:21:45 I ate them. 15:22:04 Awww. 15:22:18 I was hungry! 15:23:14 Now we won't get any judging done :( 15:23:24 * Razor-X thinks this is a plot by pikhq to win the contest. 15:24:49 Committee meeting? 15:25:59 Yes. 15:26:13 I didn't hear about it. 15:26:19 Good job being asleep. 15:26:29 Well, I need GregorR and RodgerTheGreat to make a new date. 15:27:06 When was it supposed to be? 15:27:58 Last Saturday. 15:31:23 -!- Sgeo has joined. 15:51:38 Now, is it O_< or >_O that GregorR says? 15:56:19 (Suddenly, I feel an urge to leave all channels except #haskell.) 15:57:22 -!- ihope has left (?). 15:59:59 -!- Sph1nx has quit ("äÏ Ó×ÉÄÁÎÉÑ ×ÓÅÍ!"). 16:49:47 good morning, everyone. 16:55:38 Morning RTG 17:15:41 -!- CakeProphet has joined. 18:29:42 -!- meatmanek has quit (Client Quit). 18:47:02 -!- Aardwolf has joined. 18:47:45 can a language that uses only a stack on which you can only push, pop and read the top number, be turing complete? 18:47:55 (as only memory) 18:48:49 Aardwolf: push-down automata? 18:49:07 I guess so, let me look at the wiki 18:51:47 I'm looking at the pushdown automaton article of wikipedia (because voxelperfect isn't responding to me at the moment), and the wikipedia article isn't making clear to me whether a push down automaton is a subset of a finite automaton or vica versa :/ 18:53:18 Aardwolf: check chomsky's hierarchy 18:55:08 nice, got it now 18:57:35 -!- Asztal has joined. 19:32:44 -!- ihope has joined. 19:35:42 Now I know where GregorR hangs out all the time. 19:39:55 What I don't know is how to get these files to him. 19:40:35 -!- me_tmanek has joined. 20:00:25 -!- lindi- has quit (kornbluth.freenode.net irc.freenode.net). 20:03:20 -!- lindi- has joined. 20:05:46 -!- lindi-_ has joined. 20:05:48 -!- lindi- has quit (Remote closed the connection). 20:36:54 -!- calamari has joined. 20:38:29 -!- Arrogant has joined. 20:51:31 -!- me_tmanek has changed nick to meatmanek. 21:22:27 -!- lindi-_ has changed nick to lindi-. 21:36:26 -!- calamari has quit (Read error: 110 (Connection timed out)). 21:45:30 8.98755179 * 10^16 joules. 22:09:17 -!- tgwizard has quit (Remote closed the connection). 22:27:24 -!- Asztal has quit ("Chatzilla 0.9.72-rdmsoft [XULRunner 1.8.1b2/0000000000]"). 22:58:56 !Egobot is working! 22:59:04 or rather, it isn;t 23:01:28 I'm well aware. 23:01:33 I'm doing some computer spring cleaning. 23:01:41 I'll bring it back up in about 35 DVDs. 23:04:30 bah 23:04:40 you should use a heavily-mirrored fileserver 23:05:31 Hey, DVD 6 is done 8-D 23:05:58 And burning to DVD has nothing to do with space (though it is to free space :P ), it's more like spring cleaning - eg, I'll have a nice, empty, uncluttered disk. 23:09:03 uncluttered in what way? 23:09:21 you mean that you will get rid of all the crap files, registry cruft, etc? 23:10:42 lol windows 23:11:24 -!- oerjan has joined. 23:13:31 ...registry? 23:13:43 ^^ 23:13:52 * GregorR agrees with xor_'s assertion: "lol windows" 23:20:45 What, I can't have windows in my house? 23:20:52 >.< 23:21:06 AIR CONDITIONING WORKS BEST WITH WINDOWS /CLOSED/ 23:22:03 darn, is that why my laptop fan is so noisy...