00:15:34 ^ul ! 00:15:35 ...out of stack! 00:16:16 > unwords $ map (show . ord) "...out of stack!" 00:16:18 "46 46 46 111 117 116 32 111 102 32 115 116 97 99 107 33" 00:33:07 the computer i want is available with i5 or i7 processor, and 4GB or 8GB of RAM... but you can't get the i7 with 8GB of RAM 00:33:13 (the RAM is not upgradeable) 00:39:43 -!- derdon has quit (Remote host closed the connection). 00:41:33 another day, another TC proof. 00:43:00 kmc: What computer is that? 00:48:33 -!- DHeadshot has joined. 00:53:18 -!- DHeadshot has quit (Write error: Connection reset by peer). 00:53:48 -!- DHeadshot has joined. 00:56:51 -!- pikhq has quit (Ping timeout: 252 seconds). 00:56:57 -!- pikhq_ has joined. 00:57:56 -!- nortti has quit (Ping timeout: 248 seconds). 00:58:04 shachaf, the Dilemmatech 3000. 01:01:38 @freshname 01:01:38 Hahd 01:08:17 -!- itidus21 has changed nick to Jon_Frakes. 01:09:10 @freshname 01:09:10 Hahe 01:09:13 @freshname 01:09:13 Hahf 01:09:14 @freshname 01:09:14 Hahg 01:09:28 i sense a certain lack of creativity 01:12:13 shachaf: ThinkPad X1 Carbon 01:12:46 ThinkPad Air 01:13:03 so i have to choose between 1 MB of L3 cache or 4 GB of RAM 01:13:46 Choose based on what things you are doing on your computer, which would work better for what you do 01:14:00 I don't know what you are using your computer for. 01:14:43 or waiting 01:14:52 someone should make a Haskell library called Hahahahahahaha 01:15:01 (Alternatively, choose by the price.) 01:16:39 yeah, that's a good tiebreaker :) 01:17:16 kmc: That's an exciting-looking computer. 01:17:32 i5/8GB is $60 more, but also it can ship next week rather than "more than 4 weeks" 01:17:37 but maybe i don't want to buy now, anyway 01:18:12 1600x900 01:18:15 Hmm. 01:18:22 * shachaf should probably care about resolution less than he does. 01:19:02 shachaf: yeah, it's more exciting than the X230 01:19:06 which is 1366x768 :/ 01:19:20 You should wait until you can get a Haswell laptop! 01:19:30 maybe 01:19:57 Then you can use AVX2. 01:20:34 and hardware transactional memory! 01:20:36 (is that in AVX2?) 01:21:06 i don't know anything about AVX instructions 01:21:13 i guess they are mostly SSE extended to 256 bits 01:21:19 AVX is 256-bit SSE. 01:21:21 Yes. 01:21:34 Hmm, there are a lot of new instructions. 01:21:39 http://software.intel.com/en-us/blogs/2011/06/13/haswell-new-instruction-descriptions-now-available/ 01:21:56 they should have 16×16 binary matrix multiply! 01:22:36 They should have it for 8×8 first. 01:22:40 Some CPU instructions I would like to see are INTERCAL select, unselect (fills unset bit positions with zero), and multiplexer. 01:23:15 the X230 is still better if you want crazy battery life by carrying around multiple batteries 01:23:49 but the X1C can charge from 0% to 80% in 35 minutes, which is cool 01:28:17 zzo38: multiplexer would have three inputs, and use one input to select between the other two bitwise? 01:28:45 x86 should have more three-operand instructions. 01:29:33 kmc: Actually many more inputs; it would be like the Muxcomp esolang instruction (although depending on the computer, it could differ in many ways, such as addressing modes and so on). 01:29:45 Well, it has three-operand addition. 01:30:20 Multiplication matrix would also be useful, though. 01:31:08 MXOR is a great instruction! 01:31:09 i wonder what is the next cryptosystem to get added after AES 01:31:21 Another thing I might like to have is an instruction for triple indirect jump with post increment. 01:31:41 i wonder if SHA-3 will be based on AES enough to use the AES round instruction 01:32:10 i don't think any of the candidates are that closely related 01:32:56 The "too much CISC" computer would include Super Mario game as a single instruction. 01:34:00 Maybe it'd have SUPERMARIO and SUPERMARIOLAST for the last round. 01:34:16 Of course this is silly. 01:34:17 SUPERMARIOWITHGAMEGENIEPLUGGEDIN 01:34:59 But one instruction I would actually like to have is an instruction to reconfigure the microcode at runtime so that the instruction set can be optimized for whatever it is that you are making. 01:35:14 One of the SHA-3 finalists is at least somewhat related to AES. 01:35:43 what's wrong with rijndahl again? 01:36:09 er, AES is Rijndael 01:36:13 i don't understand the question 01:36:15 I wonder why they have an instruction per round rather than just one instruction. 01:36:44 S-boxes make it very tricky to implement without being vulnerable to cache timing attacks, apparently. 01:37:04 yeah, i have heard that 01:37:45 There was a "constant-time lookup" instruction proposed that would get a block of memory, make sure the whole thing was in the cache, and then do a lookup in it. 01:37:52 what's sha-2? 01:38:07 SHA-256, SHA-512, etc. 01:38:20 http://en.wikipedia.org/wiki/SHA-2 01:40:45 i wonder if git will have to switch away from SHA-1 soon 01:47:30 -!- DHeadshot has quit (Read error: Connection reset by peer). 01:47:42 > ord 'x' 01:47:44 120 02:01:22 An instruction per round? Are each round have any use by itself? 02:08:29 -!- kmc has quit (Quit: leaving). 02:09:06 -!- kmc has joined. 02:15:36 $ glxgears 02:15:37 48647 frames in 5.0 seconds = 9729.383 FPS 02:15:43 OVER NINE THOUSAND FPS 02:15:57 unfortunately, the window is completely black 02:18:01 this channel has a lot of bots 02:18:03 maybe i should run a bot 02:18:05 what should it do? 02:18:17 It should bot. 02:18:24 dispense useful advice 02:20:31 i wonder what would be the social effects of a bot which allows anyone in the channel to anonymously send messages to the channel 02:24:30 Once upon a time Egobot did. 02:26:01 and how did that go 02:26:13 Not that much happened. 02:27:57 you could use blind signing to make it so the bot operator doesn't know who's submitting each message, only that they're in the channel (or working with someone who is) 02:28:06 under some rather unrealistic assumptions about traffic analysis and such 02:39:11 hah, cold boot attack in a spy show on television :) 02:39:31 -!- edwardk has joined. 02:43:41 -!- mjrosenb has joined. 02:44:22 kmc: Neat. 02:44:32 Simultaneously real *and* flashy enough to work on TV. 02:45:19 Phantom_Hoover, monqy if you didn't see there's a major update 02:45:30 kmc: ah-hah, found you! 02:45:43 hi mjrosenb :) 02:45:54 how's it going? 02:46:11 `welcome mjrosenb 02:46:14 mjrosenb: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page. (For the other kind of esoterica, try #esoteric on irc.dal.net.) 02:46:27 pretty good, now living on the east coast again 02:46:49 state college, pa? 02:46:55 yup. 02:46:59 oh for the love of 02:47:08 i'm not watching a flash at this hour Sgeo 02:47:13 man, that's like 200 miles inland ;) 02:47:45 oh god 02:47:46 the homestuck 02:47:59 also trying to get my compose key to output "†" 02:48:31 does a horrible implementation of a somewhat esoteric language count? :-p 02:49:31 i'd say that counts as 90% of the wiki 02:51:17 -!- edwardk has quit (Quit: Computer has gone to sleep.). 02:52:18 * mjrosenb has made some half-assed attempts to polish it as an ioccc entry, but: http://www.club.cc.cmu.edu/~mjrosenb/unlam-gc.c 02:52:36 ooh unlambda? 02:54:25 Any bets on how long it'll take for the Wii U to get cracked? 02:54:47 mjrosenb: test out my self-interpreter http://oerjan.nvg.org/esoteric/interpreter.unl :) 02:55:37 oh you only do part of it 02:55:46 Some people for god-knows-what-reason have them already, so the clock starts now. 02:56:25 no continuations :( 02:57:15 oerjan: yeah, I have pseudo-support for them 02:57:21 but it is *completely* untested 02:57:42 mjrosenb: well you don't have the input functions anyhow 02:58:20 mjrosenb: Dang it, I was thinking of doing something with a GC for IOCCC :) 02:58:25 it should be pretty easy to add those 02:58:40 mjrosenb: assuming your continuations work properly, yes 02:58:45 Gregor: i'm sure your gc would look nothing like mine 03:00:45 oerjan: oh right, unfortunately, c and gc are going to interact in particularly heinous ways 03:00:58 heh 03:02:49 kmc: you know how to add bindings to X's compose functionality, right? 03:04:34 yeah i wrote a blog post about it 03:06:02 oh right, what is your blog again? 03:06:56 http://mainisusuallyafunction.blogspot.com/ 03:07:08 http://mainisusuallyafunction.blogspot.com/2010/10/typing-mathematical-characters-in-x.html 03:10:12 kmc: do you know if there is a program that will parse .Xcompose after X has started? 03:15:46 no :/ 03:15:53 kmc: I feel I still need to applaud you for calling C++ (rightfully) an esolang. 03:18:50 -!- kmc has quit (Quit: Lost terminal). 03:19:47 -!- kmc has joined. 03:32:58 -!- DHeadshot has joined. 03:34:36 Sgeo, damn you 03:35:00 otoh i have read the sufferer dialogue sooner than i otherwise would have and my life is infinitely better for it 03:36:09 tswett, you too 03:36:27 Me too what? 03:36:41 Major Homestuck update 03:36:47 * tswett nods. 03:36:48 Thanks. 03:36:49 Huge walkaround 03:36:53 You're welcome 03:39:55 Thus far I've had to restart once, I've gotten lost twice, and I caused a minor sequence break. 03:45:09 Please tell me your opinion what I wrote so far about this: http://zzo38computer.cjb.net/roguevm/roguevm.tex 03:50:50 Phantom_Hoover: haha 03:51:01 Sgeo: I also homestuck 03:51:10 but I saw right away on the feed 03:51:27 Terezi's ancestor is King Radical, calling it now 03:52:29 zzo38: Thus far, seems like a reasonable spec for a VM. 03:52:59 zzo38: Designed to support a rogue-like text UI, but at least slightly more flexible than that, I take it? 03:53:32 ****SPOILER ALERT*** 03:53:36 Phantom_Hoover: karkat's is the best 03:53:40 mainly due to one conversation 03:53:47 yes 03:53:49 yes he is 03:54:16 Phantom_Hoover: have you had the conversation between him and latula yet? 03:54:22 yes 03:54:23 zzo38: It looks like you've got it set up to be relatively sane to emulate, as well; the instruction coding, though not the *simplest* to decode, is fairly reasonable. 03:54:24 yes i have 03:54:28 I just finished it. 03:54:32 it is the best 03:54:41 His previous conversations were good too. 03:54:42 the face at the end is priceless 03:54:53 (the absolute simplest would give you 16-bit addresses, so it's a single opcode to grab the address) 03:55:07 (btw theoretical logreading elliott don't bitch at me for spoilers, bitch at coppro.) 03:55:15 hey 03:55:19 i put a spoiler alert in 03:55:27 and also hussie says don't give a fuck 03:55:30 people should homestuck first 03:55:36 then things that may have spoilers 03:55:55 I didn't figure out if getting hussie to run away does anything 03:55:56 did you? 03:56:05 Dunno. 03:56:06 zzo38: Also, just out of curiosity, do you intend for code to execute out of RAM, or only out of ROM? 03:57:41 'corporealnormative' 04:00:02 Phantom_Hoover: YES 04:00:04 oh god yes 04:04:10 OK so that took me an hour. 04:04:30 I definitely recall thinking "how long can it take, Cascade is only 13 minutes2. 04:04:33 *" 04:05:20 * Phantom_Hoover -> sleep 04:05:22 -!- Phantom_Hoover has quit (Quit: Leaving). 04:06:23 @tell atriq Try 48 ~!~)): [[48 [)):] [~!~)):] ~~) !][49 [~!~)):] [)):] )~]] 04:06:23 Consider it noted. 04:06:36 @tell Arc_Koen Try 48 ~!~)): [[48 [)):] [~!~)):] ~~) !][49 [~!~)):] [)):] )~]] 04:06:36 Consider it noted. 04:17:52 pikhq_: Both ROM and RAM. 04:18:12 -!- MoALTz has joined. 04:18:18 And, yes it is designed to support a rogue-like text UI, but at least slightly more flexible than that. 04:18:29 It says so in the introduction. 04:18:52 zzo38: Neat. 04:20:03 @tell Phantom_Hoover It's not Flash (except for the Intro). It's HTML5 04:20:03 Consider it noted. 04:20:34 I case I did not say: The .tex and .dvi are in the same directory; I distribute both. 04:20:37 Sgeo: really? 04:20:46 hmm actually 04:21:01 Also, some chapters are very short so there is empty space on the page; some artwork could be placed there as well as on the title page possibly. 04:21:02 https://github.com/Gankro/Jterniabound 04:22:49 -!- oerjan has quit (Quit: Good night). 04:34:25 -!- kmc has quit (Quit: leaving). 04:43:40 I will write more of this file later today, probably. 04:43:43 I got myself a puzzle 04:44:09 Given a lexicographic permutation, generate the next one 04:47:09 So, given something like "0123" it will return "0132" 04:47:16 -!- MoALTz has quit (Ping timeout: 248 seconds). 04:48:01 There's a standard algorithm for that. Is this homework? 04:48:16 More eulerwork 04:48:26 The following algorithm generates the next permutation lexicographically after a given permutation. It changes the given permutation in-place. 04:48:27 I looked at the algorithm already 04:48:29 Find the largest index k such that a[k] < a[k + 1]. If no such index exists, the permutation is the last permutation. 04:48:32 Find the largest index l such that a[k] < a[l]. Since k + 1 is such an index, l is well defined and satisfies k < l. 04:48:34 Swap a[k] with a[l]. 04:48:37 Reverse the sequence from a[k + 1] up to and including the final element a[n]. 04:48:39 I looked at the algorithm already 04:48:47 Just got to implement it 04:48:54 Well there you go. 04:48:57 Going to do it in haskell I guess 04:50:21 Oh hey, pattern matching (x:y:ys) works 04:52:45 Seems I'm not as comfortable with functional programming yet as I should be 04:54:06 I realize this defeats the point of the exercise, but isn't there a "permutations" function in Haskell? :) 04:55:29 There is but it doesn't return them in lexicographic order =P 04:55:55 Ah. 04:56:45 I guess for what I want something that returns a list of strings would be better 04:56:49 lexicogrpahic ordering of permutations is annoying 05:06:33 I wonder if a foldl here is the right idea 05:08:04 Maybe not 05:12:04 If you want to generate all of them, I don't think you need the slightly tricky next-permutation thing, unless you want it of course. 05:12:11 > let perms [] = [[]]; perms l = concatMap (\i -> map (i:) (perms $ delete i l)) l in perms "1234" 05:12:12 ["1234","1243","1324","1342","1423","1432","2134","2143","2314","2341","241... 05:12:20 > let perms [] = [[]]; perms l = concatMap (\i -> map (i:) (perms $ delete i l)) l in perms "123" 05:12:21 ["123","132","213","231","312","321"] 05:13:16 In other words, "all permutations with the smallest element in the first place; then those with the second-smallest in the first place; etc." 05:14:00 (With a sort if the input items aren't in lexicographical order, and something else than 'delete i l' if there can be duplicates.) 05:18:56 -!- kmc has joined. 05:19:09 when will i learn my lesson 05:19:14 that i should never upgrade X 05:38:16 kmc: upgrade to waylan! 05:38:24 kmc: you'll never need to touch X again! 05:48:16 "Wayland - way cool!"? 06:21:31 -!- impomatic has quit (Quit: http://RetroProgramming.com). 06:23:22 * shachaf gyres and gimbles in the Wayland. 06:23:28 kmc: Did you give up on irssi+mosh? 06:24:01 -!- asiekierka has joined. 06:29:53 -!- mig22 has joined. 06:33:42 -!- copumpkin has quit (Quit: Computer has gone to sleep.). 06:36:22 Wow. Y'know how nop on x86 is actually xchg ax, ax (xchg eax, eax in 32-bit mode)? 06:36:48 x86_64 came *this close* to jacking it up: xchg eax, eax would do nothing and then clear the high 32 bits of eax. 06:36:51 Except it's not in 64-bit mode, right? 06:37:03 Yes. But it's an explicit nop. 06:37:11 I mean, you gotta have a nop, right? 06:37:18 So they went and just said 0x90 is explicitly nop, and gave xchg eax, eax a different encoding. 06:37:31 If you for some reason want to clear the high 32 bits of eax that way. 06:38:44 Presumably you can also mov eax, eax? 06:38:55 Yeah, think so. 06:39:27 They do have some nops that really are only nops too, these days. (And IIRC both Intel and Amd optimization manuals have their own recommended "fastest" nop sequences for lengths up to 16 bytes or so.) 06:40:09 In pretty much all x86 CPUs for $long_time xchg eax, eax has been hard-coded as a nop anyways. 06:40:33 (so you don't have a dependency in the pipeline on eax, and it doesn't take as long to execute, etc. etc.) 06:41:29 From what I can recall, some of those sequences were really kinda silly if you look at the meanings; piles of prefixes that don't really matter since it's a nop, and so on. 06:44:27 -!- zzo38 has quit (Remote host closed the connection). 06:45:21 Oh, neat. 06:45:27 I just made llvm-mc segfault. 06:45:44 Looks like it happened because of -triple=blah 06:46:23 shachaf: -mc? 06:47:15 mjrosenb: Oh, you're in here already. 06:47:38 I guess my /msg was redundant as well as incomplete. 06:47:44 mjrosenb: llvm-mc is great. 06:47:58 echo 'mov %eax,%eax' | llvm-mc -show-encoding 06:48:19 oic, that sounds like a project I half-finished a month ago 06:48:26 which I think I told you about elsewhere 06:48:38 The REPL? 06:48:42 This is just an assembler. 06:48:52 (And disassembler, and things.) 06:48:55 I still want the REPL! 06:49:27 -!- nooga has joined. 06:49:46 mjrosenb: I was "reverse-engineering" some code with some Windows debugger and it was pretty nice. 06:50:22 At every step it shows you all the registers and memory, whether the current jump will be taken, effects of the current instruction, etc. 06:52:08 shachaf: i'm still planning on working on it 06:52:19 i should put some sort of a license on that code 06:52:30 Then other people will surely contribute! 06:55:49 whoa, dude, QFC isn't a national supermarket chain. 06:59:40 * mjrosenb has never heard of QFC 07:00:11 Apparently it's only in some parts of the Pacific Northwest. 07:02:15 Quantum Fried Chicken? 07:24:36 -!- mig22_ has joined. 07:24:36 -!- mig22 has quit (Read error: Connection reset by peer). 07:24:37 -!- mig22_ has changed nick to mig22. 07:53:25 -!- Jon_Frakes has changed nick to itidus21. 08:40:49 -!- Eladith has joined. 09:11:19 kmc: I talked to gdb about the cryptography CTF thing and he seems unenthusiastic about doing one which is entirely about cryptography. 09:11:52 But he said he'd love to play one if someone else made it, hint hint. 09:12:19 centucky tsicken fried 09:14:59 -!- TeruFSX has quit (Read error: Connection reset by peer). 09:16:35 -!- TeruFSX has joined. 09:18:38 -!- AnotherTest has joined. 09:18:47 Hello 09:18:52 -!- Nisstyre has quit (Ping timeout: 246 seconds). 09:21:57 -!- Nisstyre has joined. 09:36:04 -!- mig22 has quit (Read error: Connection reset by peer). 09:36:26 -!- mig22 has joined. 10:24:09 -!- oklofok has joined. 10:24:17 do i h�v utf8 now 10:24:53 it seems to be impossible to get mirc to use it 10:29:22 i'm sure you can tell just from that one character 10:29:41 you can probably extract my credit card number from it 10:31:20 http://en.wikipedia.org/wiki/CESU-8 10:31:22 How exciting. 10:32:38 i have that? 10:32:45 I hope not. 10:33:07 Hmm -- I wonder whether *I* have that. 10:33:08 Eek. 10:34:40 `echo 㯿 10:34:46 `run echo 㯿 10:34:49 ^echo hi 10:34:49 hi hi 10:34:51 㯿 10:35:05 㯿 10:35:30 should i be seeing that as something other than nonsense? 10:35:59 -!- oklofok has quit. 10:36:51 -!- oklofok has joined. 10:37:02 13:34:17 shachaf • `echo ã¯¿ 10:37:09 still nonsense here 10:37:16 Your UTF-8 is completely broken, yes. 10:37:30 is it bröken here? 10:37:47 oklopol is mirc, oklofok is kvirc 10:38:19 in both i'm supposedly using utf-8, but apparently it's just too hard to do right. 10:39:21 ö 10:39:41 ó 10:39:50 økløpøl 10:39:54 i'm seeing myself right, but oklopol doesn't even see itself right :D 10:40:00 hey those look right! 10:40:22 incidentally, that's how you actually write my name 10:40:38 well, the last ø also has an umlaut 10:41:28 økløpø̈l 10:41:42 yes 10:42:03 although really the first ø also has an underumlaut. 10:42:15 (pronounced exactly as you'd expect) 10:42:25 (double the ö but reversed) 10:51:24 oklofok is kvircy 10:53:31 -!- kinoSi has quit (Read error: Connection reset by peer). 10:53:59 -!- kinoSi has joined. 11:18:05 -!- Phantom_Hoover has joined. 11:19:03 -!- derdon has joined. 11:27:31 -!- oklo has joined. 11:28:05 -!- Arc_Koen has joined. 11:28:19 hello 11:28:19 Arc_Koen: You have 1 new message. '/msg lambdabot @messages' to read it. 11:29:09 -!- Arc_Koen_ has joined. 11:29:09 -!- Arc_Koen has quit (Read error: Connection reset by peer). 11:29:09 -!- Arc_Koen_ has changed nick to Arc_Koen. 11:36:11 -!- oklofok has quit (*.net *.split). 11:39:06 > char 48 11:39:07 No instance for (GHC.Num.Num GHC.Types.Char) 11:39:07 arising from the literal `4... 11:39:21 > char '\48' 11:39:22 0 11:39:36 > '\48' 11:39:37 '0' 11:39:50 @ty char 11:39:51 Char -> Doc 11:39:57 Hah. 11:41:56 > chr 48 11:41:57 '0' 11:42:01 Is probably the intention. 11:42:14 most definitely 11:42:29 lambdabot: Just how many symbols you have in there after your default imports? 11:42:43 @google inurl:L.hs 11:42:45 http://prospectheights.patch.com/articles/int-l-hs-teacher-takes-kids-ice-skating-for-first-time 11:42:47 @google inurl:L.hs lambdabot 11:42:49 https://bitbucket.org/zeekay/lambdabot/src/0e7b40d401e7/State/L.hs 11:43:03 Well... Not the optimal result, but it'll do. 11:43:29 > cake !! 1 11:43:31 "One can prepared coconut pecan frosting." 11:43:50 > reverse . take 8 . reverse . map head $ cake 11:43:52 "ASCIICAT" 11:44:05 Amazing. 11:44:16 "meow" 11:44:18 -- asciicat 11:51:37 so I had an idea for a new language 11:52:06 it draws inspiration from "spacechem" 11:53:37 it's 2-dimensional, with befunge-like commands > each ip (let's call them workers) can either be empty-handed, or carrying a number 11:54:39 Concurrent Funge-98 is a bit like that, except the IPs have full stacks instead of numbers. 11:55:01 -!- MoALTz has joined. 11:55:54 workers can DROP the number they're carrying, or PICK up a number (but there has to be a number where they are at that moment) 11:57:06 for every worker there is an input emplacement, in which appears a number when the worker meets the input command 11:57:27 two numbers can never be in the same place, and a worker carrying a number can never walks over a number 11:57:40 (so the input has to be picked up before it can produce a new number) 11:58:37 operations can be made with adjacent numbers : for instance, if a worker walks over a '+' while carrying a number, his number is incremented by each number which is on the floor on an adjacent '+' 11:59:14 there's also an output zone that prints numbers when they are dropped there 11:59:33 and that's pretty much how far I've been :) 11:59:49 It sounds a bit finite. 12:00:32 well, there can be as many workers as the programmer has declared 12:01:02 each worker has his one commands - a worker's > and there are synch commands to force a worker to wait for another 12:02:58 Yes, but it sounds like there'd be a finite amount of storage, if you can't have more than one number in one cell (be it carried or dropped), and if numbers can't be dropped further away than what there are commands written to. 12:03:27 yes, that's a problem 12:03:58 Unless the workers can write new commands to non-tracky regions, in which case it just sounds very difficult. 12:04:08 haha 12:04:20 I did like SpaceChem quite a lot, FWIW. 12:04:30 Possibly due to the fungey connections. 12:04:55 fungot: Did you like SpaceChem? I would think you'd have a real aptitude for it. 12:04:56 fizzie: oh tusho, i want to experiment with depends on who you're talking with scheme programmers here. my hair keeps obscuring my vision out there. 12:05:08 I could allow carrying workers to walk over numbers as long as they don't try to pick it up, but that wouldn't really solve the problem (at least not in a usable way) 12:05:43 I suppose if the numbers can be arbitrarily large, that could be enough. 12:05:55 right 12:06:18 also my problem is that one-char commands are not really appropriate 12:06:31 so maybe each worker's playfield should be preceded by a few define 12:06:53 -!- DHeadshot has quit (Ping timeout: 246 seconds). 12:06:57 like "define A to be the 'synch with worker x' command" 12:07:35 also it would be way more readable if several workers could be define at the same place, like in spacechem 12:07:50 -!- DHeadshot has joined. 12:08:10 You could have a graphical editor for it, with the support for showing an arbitrary subset of layers. 12:08:18 oooooh 12:08:22 nice 12:08:36 I've never programmed anything graphical though 12:08:40 A bit of extra work, of course. 12:14:56 -!- cuttlefish has joined. 12:15:00 -!- boily has joined. 12:16:19 wait, did Oerjan just prove Fueue was turing-complete while I was sleeping? 12:18:17 -!- ogrom has joined. 12:22:21 sleep: the main cause of turing-completeness proving. 12:22:55 I must've been sleeping for that. 12:24:02 mine was briefly interrupted at 3:00am after a nightmare. 12:24:15 (last night's chinese restaurant was good, but I shouldn't have eaten that much...) 12:24:34 Lastlog just says "03:41 < oerjan> another day, another TC proof." with not much context. 12:24:49 ah. good to hear the proof is still good. 12:27:03 -!- Kestral has joined. 12:27:37 -!- Kestral has left. 12:36:02 -!- pikhq has joined. 12:36:05 -!- pikhq_ has quit (Ping timeout: 252 seconds). 12:57:39 -!- impomatic has joined. 13:02:32 -!- ogrom has quit (Quit: Left). 13:03:07 -!- ogrom has joined. 13:56:22 “According to my map of the yellow woods, this road diverges here.” “It doesn't matter which road we take: later we'll just TELL people we took the more indie one!” “Nice! I'm glad we didn't misunderstand this quote as is commonly done.” 14:01:09 -!- soundnfury has quit (Ping timeout: 252 seconds). 14:15:44 Gregor 14:15:44 Phantom_Hoover: You have 1 new message. '/msg lambdabot @messages' to read it. 14:15:48 are you quoting something 14:20:27 i looked it up, apparently the first sentence relates to a robert frost poem 14:21:23 Phantom_Hoover: Dinosaur Comics. 14:21:39 itidus21: And that's the obvious part. If that's "apparently" then you should consider, y'know, reading something. Ever. 14:22:28 shachaf: hm? i've been using irssi+mosh for a while now 14:28:51 "I don't know what the fuck was going on with the scottish education board in the 1970s. Do you like whiskey? Do you hate kids? The job's yours." 14:31:45 itidus21, obviously this was not written by a Scot. 14:32:17 well it could be a sellout 14:32:52 Yeah, a True Scotsman wouldn't have even bothered to ask, “do you like whiskey?” 14:32:54 That's implied. 14:33:14 i do sense how jarring it is 14:33:24 as if it was written by me 14:33:40 shachaf: my connection was dropping because i was rebooting the machine on which i run irssi :) 14:33:53