# HG changeset patch # User HackBot # Date 1361653705 0 # Node ID 48146b3fe1d6eb1c9937e5c2da73370598a369bf # Parent 3b22e800418cdd40dba10b26197df7b3ef299b57 pastelog olsner diff -r 3b22e800418c -r 48146b3fe1d6 paste/paste.13540 --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/paste/paste.13540 Sat Feb 23 21:08:25 2013 +0000 @@ -0,0 +1,301 @@ +2007-08-07.txt:18:50:38: -!- olsner has joined #esoteric. +2007-08-07.txt:18:53:54: * olsner also once learned to 120 but is now back to just 60 +2007-08-07.txt:18:54:24: yeah yeah +2007-08-07.txt:18:57:09: I have a mixture of chunksizes... starting with two (I didn't set out to learn a lot of pi, just as much as could fit in a 64-bit float ;-), then a few groups of 3 or 4, then like pairs of 4's to 60, and 60-120 I memorized in 3's +2007-08-07.txt:18:58:17: 3 . 14 15 92 65 35 89 79 32 38 46 264 338 32 79 50 2884 1971 6939 (9375 1058) (2097 4944) +2007-08-07.txt:19:00:50: ehird`: well, it's not natural, it's transcendental +2007-08-07.txt:19:01:00: olsner: har har har har har har har yawn +2007-08-07.txt:19:14:15: Podemos usar = let's use? +2007-08-07.txt:19:15:04: and what's 'otras' mean? +2007-08-07.txt:19:17:34: lament: you're 10 digits away from mine and oklofok's baseline, and 70 digits away from our max +2007-08-07.txt:19:19:43: that's what I guessed +2007-08-07.txt:19:19:55: seems I do know a little bit of spanish after all +2007-08-07.txt:19:22:53: olsner: i don't feel like learning any more, and 50 is a nice round number :) +2007-08-07.txt:19:23:25: lament: just pointing out that you're behind ;-) +2007-08-07.txt:19:23:35: olsner: actually i know all digits of pi +2007-08-07.txt:19:23:40: olsner: 0,1,2,3,4,5,6,7,8,9 +2007-08-07.txt:19:24:04: lament: har har har har hrrg +2007-08-07.txt:19:39:00: oklofok: but on IRC, all that matters is what you're writing... and you seem to be writing english ;-) +2007-08-07.txt:19:41:24: ja ;-) ich bin nicht deutsch, aber ich kann es siemlich sprechen +2007-08-07.txt:19:44:17: and a few french phrases "je suis une pomplemousse avec deux jeune bleu", "je ne sais pas, j'aime tout le coleurs" ;-) +2007-08-07.txt:19:45:23: oh, I forgot the 'gut' +2007-08-07.txt:19:46:38: it just sounded right because the phrase I was aiming for also begins with 'siemlich' +2007-08-07.txt:19:47:15: or *ziemlich ;-) +2007-08-07.txt:19:49:00: oklofok: whut? have I been making up german words? +2007-08-07.txt:19:50:16: but ziemlich is a word +2007-08-07.txt:19:55:52: and #implang would be like a channel where you mustn't speak any known language? +2007-08-07.txt:19:57:26: * olsner accidentily joined #impland instead +2007-08-07.txt:21:33:27: LOOP probably does everything from mapcar to forth's begin..while..while..repeat..else..then loop +2007-08-07.txt:21:36:09: dunno ;-) as far as I understand forth, those control structures are just manipulations on some kind of control stack and can be combined virtually without limits +2007-08-07.txt:21:39:27: oh, you're asking about CL's LOOP, not about forth? I' not a big fan of loop so I've actually never used it ;-) +2007-08-07.txt:22:32:44: -!- olsner has quit (). +2007-08-08.txt:06:17:05: -!- olsner has joined #esoteric. +2007-08-08.txt:07:08:12: -!- olsner has quit (). +2007-08-08.txt:07:36:39: -!- olsner has joined #esoteric. +2007-08-08.txt:07:54:17: -!- olsner has quit (). +2007-08-08.txt:17:17:44: -!- olsner has joined #esoteric. +2007-08-08.txt:18:56:13: hmm... how do you do call/cc in haskell? +2007-08-08.txt:18:57:23: ah, a monad.. should've guessed ;-) +2007-08-08.txt:19:01:28: we used Chez Scheme for our SICP course +2007-08-08.txt:19:02:08: oh, that reminds me that I was thinking of going through that tutorial... any day now +2007-08-08.txt:19:03:35: hmm... please clarify? +2007-08-08.txt:20:48:00: I'd like to see the top-ten populous animals... things like cockroaches - how many can there be on the entire earth? +2007-08-08.txt:20:52:01: hehe, the Methuselah Mouse Prize is somewhat like competing in server uptimes, but for mouse breeders +2007-08-08.txt:20:52:36: current record: a mouse that lived for 1819 days +2007-08-08.txt:22:36:59: they think you're a terrorist +2007-08-08.txt:23:17:12: -!- olsner has quit (). +2007-08-09.txt:06:54:44: -!- olsner has joined #esoteric. +2007-08-09.txt:08:09:44: -!- olsner has quit (). +2007-08-09.txt:21:01:32: -!- olsner has joined #esoteric. +2007-08-09.txt:21:17:59: is unicode turing complete? +2007-08-09.txt:21:18:16: a maze generator *generating* unicode is a different matter entirely +2007-08-09.txt:21:22:18: ;-) +2007-08-09.txt:21:23:24: the algorithm for bidirectional rendering of text seems quite intricate though - a few carefully inserted extra rules could perhaps make it turing complete +2007-08-09.txt:21:27:11: javascript ;-) +2007-08-09.txt:21:28:40: RodgerTheGreat: make timing matter too ;-) +2007-08-09.txt:21:28:56: the entire language is one big race condition, hehe +2007-08-09.txt:21:40:10: 1 is also a power of 2 +2007-08-09.txt:21:40:21: 0 bits ;-) +2007-08-09.txt:21:47:37: hello.jpg? +2007-08-09.txt:21:47:46: meta-goatse? +2007-08-09.txt:21:49:24: ehird`: do you *really* think it had mnemonics? :P +2007-08-09.txt:21:51:55: I guess you'd need load, store and some way to tell load and store where to load/store from/to +2007-08-09.txt:21:52:51: OP --> LD addr-to-data,reg; OP reg +2007-08-09.txt:21:53:06: but the address is a kind of immediate ;-) +2007-08-09.txt:21:53:32: then no, you wouldn't need immediates +2007-08-09.txt:23:01:39: I think NOP is the quintessential non-essential operation :P +2007-08-09.txt:23:01:58: *perhaps* useful to fill branch delay slots though +2007-08-09.txt:23:05:57: olsner: LD addr-to-data,reg +2007-08-09.txt:23:06:05: olsner: how would you put this data in the address? :) +2007-08-09.txt:23:06:50: ehird`: let's say addresses 0-200 is code and 200-250 is data... just LD 201,reg1 to load the contents of address 201 into register 1 +2007-08-09.txt:23:07:10: and ST reg1,201 would put a recalculated value back into memory +2007-08-09.txt:23:07:46: not really - it could be loading code into registers to modify itself +2007-08-09.txt:23:08:19: nah, just let bits 0-31 control the page number :P +2007-08-09.txt:23:09:41: olsner: how would you personally define ST? +2007-08-09.txt:23:10:23: 4 addresses? that's just the same as having 4 registers though :P +2007-08-09.txt:23:35:06: -!- olsner has quit (). +2007-08-10.txt:08:03:37: -!- olsner has joined #esoteric. +2007-08-10.txt:13:10:04: -!- olsner has quit (). +2007-08-10.txt:19:33:28: -!- olsner has joined #esoteric. +2007-08-10.txt:19:57:29: oklokok: C types are guaranteed to have a size in bytes defined at compile-time +2007-08-10.txt:19:58:40: and bytes are afaik defined to be 8-bit quantities... +2007-08-10.txt:20:01:46: well, PC:s aren't turing complete either due to the finite size of memory +2007-08-10.txt:20:07:23: ehird`: sizeof(char) could be sizeof(pointer-to-bignum) +2007-08-10.txt:20:07:38: olsner: Sure.. So what? +2007-08-10.txt:20:08:27: I mean, sizeof(void *) would be composed of bignums in such a way as to have constant size (but use hidden extra data to enable unbounded values) +2007-08-10.txt:20:08:55: thus, sizeof's would be bounded, but the values contained unbounded +2007-08-10.txt:20:09:34: could be just 1, since a byte is a bignum +2007-08-10.txt:20:12:25: there is contention as to whether that byte size actually is mandated by the standard ;-) +2007-08-10.txt:20:20:41: olsner: there's contention as to... wha? +2007-08-10.txt:20:21:28: whether the size of a byte is defined by the C standard to be exactly 8 bits +2007-08-10.txt:20:23:10: it probably is clear on that... you just have to read that part of the standard ;-) +2007-08-10.txt:20:26:25: I think the discussion did have the potential to bring forth a deeper understanding of C's turing in/completeness +2007-08-10.txt:20:30:39: MiniMaL (MINImal MAchine Language) :P +2007-08-10.txt:20:31:04: but anything above 1 instruction isn't really minimal anymore +2007-08-10.txt:20:34:07: plus, tininess isn't essential for esotericism +2007-08-10.txt:20:36:02: so, by winning the fight they lost their allies? +2007-08-10.txt:20:40:40: SimonRC: "the right O()"? +2007-08-10.txt:20:57:11: an interesting challenge would be to make the program speak "Hello world" through the speaker :P +2007-08-10.txt:20:57:41: 256 bytes of data + code makes that really really hard unfortunately +2007-08-10.txt:20:58:48: oh, so the code size is unlimited, but only the first 256 bytes are read/writable? +2007-08-10.txt:20:59:44: I'm talking text-to-speech (or a simple vocal model) hello world +2007-08-10.txt:21:01:29: but the spec doesn't say that the instruction pointer is limited to 0..255, so I guess you can get quite far with frivolous code generation ;-) i.e. generate an N-megbyte program that explicitly loads immmediate data into registers and never jumps +2007-08-10.txt:22:24:42: -!- olsner has quit (Read error: 104 (Connection reset by peer)). +2007-08-10.txt:22:25:19: -!- olsner has joined #esoteric. +2007-08-10.txt:23:29:23: -!- olsner has quit (Read error: 104 (Connection reset by peer)). +2008-01-23.txt:16:27:52: -!- olsner has joined #esoteric. +2008-01-23.txt:16:28:54: heh, cobol with lazy evaluation ;-) +2008-01-23.txt:16:30:15: actually I think it'd be better than plain cobol in most ways +2008-01-23.txt:16:30:33: olsner: not quite cobol with lazy evaluation, if you say COBOL already has a value +2008-01-23.txt:16:32:49: ehird: no, but it kind of looked like one of those let x = ... in ... x ... constructions familiar from haskell one-liners +2008-01-23.txt:16:33:04: olsner: yeah +2008-01-23.txt:16:35:26: Slereah: you could try looking for half adders and full adders, the digital circuits for addition - connect n full-adders and you can do n-bit addition +2008-01-23.txt:16:38:55: Underload? +2008-01-23.txt:16:39:59: oh, is it a functional stack language? +2008-01-23.txt:16:42:53: heh, that's basically just a web interface for cat +2008-01-23.txt:16:43:57: olsner: 'xactly +2008-01-23.txt:16:54:59: reduce = foldr? +2008-01-23.txt:16:55:16: olsner: or foldl, i dunno +2008-01-23.txt:16:58:19: yeah, connection problems often lead to having your files renamed? +2008-01-23.txt:16:59:27: dangerous script, that +2008-01-23.txt:17:00:23: I think you can fix that with the proper mount flags +2008-01-23.txt:17:02:15: hmm, but how can you be a sysadmin without administration privileges on the machines you're supposed to admin? +2008-01-23.txt:17:02:58: oh joy +2008-01-23.txt:17:10:09: our project management system at work is called Project Management System, i.e. PMS :P +2008-01-23.txt:17:15:09: any nice small string rewriting esolangs out there? thinking of writing an interpreter in mod_rewrite +2008-01-23.txt:17:15:15: olsner: yes +2008-01-23.txt:17:15:16: olsner: thue +2008-01-23.txt:17:16:24: you don't know about haskell? you should try it out, it's sweet +2008-01-23.txt:17:17:05: "if it's not an esolang, ..."? +2008-01-23.txt:17:17:29: oh, I see +2008-01-23.txt:17:17:58: I read it as "what's this haskell? as long as it's not an esolang, let's take it" +2008-01-23.txt:17:18:46: underload :: Stack -> (String, Stack) +2008-01-23.txt:17:19:03: olsner: compiler. +2008-01-23.txt:17:19:17: olsner: the way we compile it is... a bit hard to grok +2008-01-23.txt:17:20:15: does underload have input? +2008-01-23.txt:17:20:29: olsner: no +2008-01-23.txt:17:21:15: ah, yes, forgot the part about the input program +2008-01-23.txt:17:27:40: apt-get darcs +2008-01-23.txt:17:27:56: olsner: this is a good point, beforehand ais523 couldn't install anything though +2008-01-23.txt:17:29:03: darcs has a pretty low barrier to entry really, took like 30 minutes to get going +2008-01-23.txt:17:29:28: no funky databases, servers or any of that crud +2008-01-23.txt:17:33:30: how would you set up a darcs push without giving shell access? +2008-01-23.txt:17:33:41: olsner: i'm not sure, but meh +2008-01-23.txt:17:36:13: I guess the secure way is to darcs send things to an e-mail and let some maintainer person apply after review +2008-01-23.txt:17:36:37: olsner: yes, well, that's not quite rapid enough for me :-) +2008-01-23.txt:17:36:41: I've heard of e-mail services with GPG-based authentification of patches +2008-01-23.txt:17:36:55: but still, ssh-access is probably still easiest +2008-01-23.txt:17:40:37: isn't user@host:path the syntax for ssh? yeah :P +2008-01-23.txt:17:45:42: huh? darcs get worked on a non-repository? +2008-01-23.txt:17:45:54: olsner: that is a repository. +2008-01-23.txt:17:46:21: "remove that dir, i need to get the repo up first" +2008-01-23.txt:17:47:29: darcs record +2008-01-23.txt:17:47:52: olsner: darcsum. +2008-01-23.txt:17:48:11: oh +2008-01-23.txt:17:50:58: olsner: the underload compiler is interesting because at first glance, it seems self-modifying and uncompilable +2008-01-23.txt:17:54:03: olsner: what's the simple way to get a read-only darcs? +2008-01-23.txt:17:54:27: ehird: I had a http server laying around and just set up a vhost for darcs +2008-01-23.txt:17:54:40: olsner: i don't have a server lying around until i get my site up :-) +2008-01-23.txt:17:57:20: olsner: any other easy way? +2008-01-23.txt:17:58:09: searching, but it seems that http is the preferred way of getting read-only public access +2008-01-23.txt:18:01:39: it's really not that hard to set up apache2 and a vhost (or a symlink for ~darcs to go to the right place) +2008-01-23.txt:18:01:52: olsner: eww, apache +2008-01-23.txt:18:02:23: or any other web browser for that matter, since darcs only needs plain http file serving +2008-01-23.txt:18:03:14: do you also get database errors from esolangs.org? +2008-01-23.txt:18:03:16: olsner: I should write my own :P +2008-01-23.txt:18:03:19: olsner: and everyone does +2008-01-23.txt:18:03:22: olsner: once in a while +2008-01-23.txt:18:06:27: olsner: if you want to see the crazy state-stuff that the compiler uses to compile: +2008-01-23.txt:18:08:13: do I want prelude.c, postlude.c or underload.scm? +2008-01-23.txt:18:09:13: olsner: prelude.c is all the library functions and structures that the output uses +2008-01-23.txt:18:09:34: I show the code to my brain but it refuses to parse although I know that it knows scheme +2008-01-23.txt:18:09:47: olsner: it's not pretty that's for sure +2008-01-23.txt:18:09:50: time to get home from work I think! +2008-01-23.txt:18:10:32: the name 'blimp' reminds me of haskell's thunks +2008-01-23.txt:18:11:22: olsner: it's kind of similar +2008-01-23.txt:18:13:50: olsner: which is why we have ugly code +2008-01-23.txt:18:14:25: sounds like something you might be able to use a tie-the-knot technique on +2008-01-23.txt:18:14:49: olsner: is that really a programming technique? +2008-01-23.txt:18:15:16: it's all those cool haskell tricks where you build a value that depends on itself +2008-01-23.txt:18:15:53: they look like magic +2008-01-23.txt:18:16:02: olsner: how would i use that in THIS case...? +2008-01-23.txt:18:16:31: dunno, I don't even understand how the language we're compiling works yet ;-) +2008-01-23.txt:18:16:39: *you're +2008-01-23.txt:18:16:41: olsner: another thing is that i want to generate a parse tree, but for (...) i need to store the string ... as well as its parse tree +2008-01-23.txt:18:16:48: olsner: the wiki can help +2008-01-23.txt:18:21:14: well, gotta run now, cya +2008-01-23.txt:18:21:24: bye olsner :) +2008-01-23.txt:18:21:27: -!- olsner has quit ("leaving"). +2008-01-23.txt:19:19:51: -!- olsner has joined #esoteric. +2008-01-23.txt:19:28:43: wow, frappr was useless +2008-01-23.txt:19:29:35: stuck in som kind of weird slideshow, and the only place I can put a pin is Null in Texass +2008-01-23.txt:19:38:26: wow, frappr now takes all keypresses twice +2008-01-23.txt:19:43:31: emacs should be removed, not rewritten... but I guess that can be construed as motivation for doing it +2008-01-23.txt:21:51:30: can I be an oompaloompian hacker? +2008-01-23.txt:21:52:22: I get by +2008-01-23.txt:21:57:02: llanfairpwllgwyngyllgogerychwyrndrobwllllantysiliogogogochian! +2008-01-23.txt:21:57:13: olsner: bless you! +2008-01-23.txt:21:57:16: *actual place name* +2008-01-23.txt:22:21:58: something like perl? :P +2008-01-23.txt:22:22:12: olsner: nah, not really +2008-01-23.txt:22:22:36: olsner: you can't easily refactor perl, it isn't mostly written in itself, and it doesn't have a native-compiling kernel +2008-01-23.txt:22:22:50: olsner: but really jokes aside you should join #ninjacode, it's going to be awesome :P +2008-01-23.txt:22:22:51: yeah, the analogy is quite imperfect +2008-01-24.txt:01:24:53: -!- olsner has quit ("Leaving"). +2008-01-24.txt:14:41:10: -!- salparot is now known as olsnerWk. +2008-01-24.txt:15:23:24: -!- olsnerWk has quit ("Changing server"). +2008-01-24.txt:23:34:51: -!- olsner has joined #esoteric. +2008-01-24.txt:23:35:21: so, I'm working on a sed script that translates thue into mod_rewrite rules... testing it on a brainfuck interpreter written in thue :P +2008-01-24.txt:23:35:42: olsner: do you get a crapload of redirects or something? +2008-01-24.txt:23:36:50: basically you write http://host/brainfuckProgram:000_001_010_ to execute the brainfuck program on input [0,1,2] +2008-01-24.txt:23:37:59: and I rewrite it to print.php?output in the end, and let print.php just print that string +2008-01-24.txt:23:38:56: have a few bugs in it I think... and the sed script isn't exactly readable (regexps producing regexps ^^) +2008-01-24.txt:23:42:35: oh noes, mod_rewritwe translates ? into a request with a query string... and only uses the URI part for future matching... more ugly sed hacking :S +2008-01-24.txt:23:43:47: olsner: you can tell it to match whole +2008-01-24.txt:23:45:55: hmm... the apache manual suggests otherwise: "The Pattern will not be matched against the query string." +2008-01-24.txt:23:46:28: http://httpd.apache.org/docs/2.0/mod/mod_rewrite.html#rewriterule under "Note: Query String" +2008-01-24.txt:23:50:27: seems the workaround they recommend is to match URI and query string separately, with a RewriteCond %{QUERY_STRING} ... before the RewriteRule +2008-01-25.txt:00:00:27: apache doesn't handle the case of looping rewrites very well... I don't know how to abort runaway requests in apache +2008-01-25.txt:00:25:58: (Does Brainfuck over HTTP count? :P) +2008-01-25.txt:00:26:22: olsner, I suppose, if it is able to keep a socket open. (or the brainfuck equivalent) +2008-01-25.txt:00:29:59: -!- olsner has quit (Remote closed the connection). +2008-01-25.txt:22:08:34: -!- olsner has joined #esoteric. +2008-01-25.txt:23:41:55: wow, a computer with several billion tits.. now that'd be something +2008-01-25.txt:23:43:41: unfortunately, #apache didn't seem to be interested in my report on mod_rewrite's memory problems when running a brainfuck interpreter +2008-01-25.txt:23:45:34: neither 0 or 1 are prime numbers according to the definitions I've been taught +2008-01-25.txt:23:48:01: but the digits 8, 1, 6, 4 and 9 are also non-primes +2008-01-25.txt:23:49:01: olsner: i didn't say them though +2008-01-25.txt:23:49:31: oklopol: 89, 83, 79, 71, 67, 61, 59, 51, 47, 43 +2008-01-25.txt:23:50:02: olsner: well you fixed me pretty bad there +2008-01-25.txt:23:50:32: well, the condition was *using only prime numbers* +2008-01-25.txt:23:51:55: gotta go sleep, too tired to think +2008-01-26.txt:11:58:16: funny, I read that one like only a week ago +2008-01-26.txt:20:32:11: my haskell thue interpreter is far too slow... it's taken more than 30 minutes to run BF hello world through the Thue BF interpreter, and still not done +2008-01-26.txt:20:32:46: the python thue interpreter does it in 3-4 minutes +2008-01-26.txt:20:34:34: done! 33m35s :( +2008-01-26.txt:20:35:55: olsner: Write something that compiles it into Haskell rules +2008-01-26.txt:20:37:44: yeah, and ending it with thueStep (x:xs) = x:thueStep xs; thueStep [] = thueStep [] - that'd probably work! +2008-01-26.txt:20:38:31: I was otherwise thinking of building some kind of automaton and running that +2008-01-26.txt:20:38:53: olsner: that would be a slow thueStep base case +2008-01-26.txt:20:41:31: wouldn't the find part basically do the exact same thing as thueStep only not replace anything? +2008-01-26.txt:20:41:53: olsner: you could use a more efficient algorithm +2008-01-26.txt:23:24:50: what's the Juggernaut? +2008-01-26.txt:23:25:08: (and I though it was spelled juggernaught?) +2008-01-26.txt:23:25:49: ooh, nice tool +2008-01-26.txt:23:36:04: heh, funny etymology of that word +2008-01-27.txt:00:09:35: 25852016738884976640000 +2008-01-27.txt:02:25:58: -!- olsner has quit ("Leaving"). +2008-02-05.txt:01:13:19: -!- olsner has joined #esoteric. +2008-02-05.txt:01:13:39: must one join *every* channel? :P +2008-02-05.txt:02:35:38: -!- olsner has quit ("Leaving"). +2008-02-05.txt:06:09:45: -!- olsner has joined #esoteric. +2008-02-05.txt:08:48:20: -!- olsner has quit ("Leaving"). +2008-02-05.txt:22:54:26: -!- olsner has joined #esoteric. +2008-02-06.txt:00:04:26: -!- olsner has quit ("Leaving"). +2008-02-06.txt:07:09:37: -!- olsner has joined #esoteric. +2008-02-06.txt:07:24:43: [09:13] --> olsner has joined this channel +2008-02-06.txt:07:25:54: what was all the fuzz about? +2008-02-06.txt:07:26:19: well,