00:01:58 dear #esoteric: http://pastebin.com/LHwFWdDD 00:02:19 -!- augur has quit (Read error: Connection reset by peer). 00:02:19 please judge the effectiveness of these regexes at accurately determining a list of channels that are relevant to a raw IRC message. 00:02:28 sincerely, 00:02:30 kallisti 00:04:37 also I just added a special case for channel MODEs 00:04:49 because channel modes are only relevant to that channel, not every channel the sending nick is in. 00:06:15 I could probably drop the KICK one with the PRIVMSG|JOIN|... one 00:06:19 without any problems. 00:25:21 -!- soundnfury has joined. 00:27:29 http://apod.nasa.gov/apod/image/0610/newrings_cassini_big.jpg 00:27:51 Pictures like this always make me sad because I know they have no bearing on what the human eye would actually see. 00:31:18 -!- kallisti has quit (Quit: Changing server). 00:31:48 -!- nortti- has quit (Ping timeout: 245 seconds). 00:33:00 -!- kallisti has joined. 00:33:05 Hi, I'm Edward, you may remember my fugly language "spl"... 00:33:17 So, I had this idea for an esolang: "Assign" 00:33:27 you can assign to anything; you can assign a number to an operator, for instance 00:33:29 like: 00:33:37 +=5 00:33:39 6=* 00:33:54 print + 6 3 // prints 15 00:34:05 has anything like this been done before? 00:35:04 there was one that let you assign number to another number 00:35:09 FORTE 00:35:19 -!- augur has joined. 00:35:31 "It is called Forte due to the mess it makes of the Peano postulates." LIKE! 00:36:07 O, that is why you called it that. 00:36:25 -!- adu has joined. 00:36:27 yo 00:36:32 there was this thing 00:36:41 I can't remember 00:36:44 what it was 00:36:56 help 00:36:56 Then how can you explain it if you don't know? 00:37:05 well, FORTE looks nice, and something similar was my idea for Assign, but I went beyond that 00:37:10 With no information it is difficult to help 00:37:16 `welcome adu 00:37:19 adu: 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.) 00:37:20 hi oerjan 00:37:26 None of us are psychic 00:37:43 zzo38: hey speak for yourself! 00:37:46 zzo38: it was a chat room on irc.freenode.org that was about languages 00:37:59 adu: About what languages, to be specific? 00:37:59 it was very much like #esoteric 00:38:32 #esoteric-en ? :P 00:38:36 it might have been #polyglot, but I don't remember 00:38:36 `pastlog 00:38:54 adu: Well, try #esoteric-en and #polyglot and whatever see if they know this answer any better. 00:39:09 No output. 00:39:11 `pastlog 00:39:23 -!- elliott has joined. 00:39:35 * oerjan doesn't trust HackEgo when it takes that long to say No output. 00:39:36 adu: It was Trivial Pursuit. 00:39:37 elliott: You have 8 new messages. '/msg lambdabot @messages' to read them. 00:39:39 -!- elliott has left ("Leaving"). 00:39:41 maybe try without <> 00:39:42 -!- elliott has joined. 00:39:45 No output. 00:39:46 Either that, or beef jerky. 00:39:47 -!- elliott has left ("Leaving"). 00:39:54 oerjan: I've been here before 00:39:56 -!- elliott has joined. 00:40:01 It could also be marriage? 00:40:03 -!- elliott has left ("Leaving"). 00:40:06 yeah so why aren't you in the logs 00:40:12 `log 00:40:15 2007-07-25.txt:05:03:56: 3 immibis: ps 00:40:23 `pastlog adu 00:40:29 it would seem that irssi removes nicks within its channel structure before my event handler receives the QUIT message. 00:40:32 how unfortunate. 00:40:35 elliott: That's really annoying 00:40:43 `pastlog [<]adu 00:40:50 I'm not even paying attention to the channel and it's still annoying. 00:40:55 I like how FORTE is non-associative 00:40:56 No output. 00:41:09 I wonder if it's power-associative 00:41:11 * oerjan swats HackEgo -----### 00:41:14 2008-01-23.txt:06:50:44: interesting 00:41:17 in fact no, it isn't... 00:41:22 yay! 00:41:29 oerjan: yey! 00:41:49 if 8=5, then (2*2)*(2*2) is 16 but (2*2*2)*2 is 10 00:42:02 that was 4.5 years ago! 00:42:25 actually I first started hacking out on this network (irc.openprojects) about 15 years ago 00:42:56 I'm an oldbie 00:43:43 O, that is why. OK 00:44:09 soundnfury: wuttf 00:44:31 adu: Forte 00:44:42 it lets you assign to constants 00:45:07 and apparently mangles intermediate values in expressions 00:45:14 which must have been a bitch to implement 00:45:47 nah you just need some kind of dictionary/hashtable 00:46:05 not really, you'd just have to attach logic to every math operation, that's all 00:46:25 yeah but I have a vague feeling there might be a way to construct an infinite loop in said mangulator 00:46:28 oerjan: I like how you think 00:46:42 * Sgeo goes to install Blender 00:46:43 adu: i almost tried implementing once :P 00:46:48 oh wait no, it computes expressions /before/ you assign 00:46:55 but someone else did it before i overcome my laziness 00:46:59 oerjan: I've only written a dozen parsers 00:46:59 *it once 00:47:06 so I can't say 5=5+2 and have insanity ensue 00:47:15 oerjan: I've only implemented 2 languages: Funge-98 and Scheme 00:47:35 I guess I can reconstruct the quit message by handling the quit event itself. 00:47:48 Funge-98 was definitely harder than Scheme 00:47:56 adu: among other things, I'm trying to implement a LISP for the ZX Spectrum 00:48:01 is this bad? 00:48:30 soundnfury: yes 00:48:37 soundnfury: I think you can try if you like to do so. 00:48:38 huzzah! 00:48:39 I would recommend at least RPI 00:49:20 but if you need some z80 docs, I think I have some backups of a webcrawl about 10 years ago 00:49:33 adu: nah, I've got all the z80 knowledge I need... 00:49:37 k 00:49:42 I've even written an emulator 00:49:45 soundnfury: what kind of lisp? 00:49:48 (s'called Spiffy) 00:50:00 nortti_: a dialect I'm devising as I go along 00:50:39 * adu <3 GoLang 00:50:47 ooops 'along' 00:51:04 (SET MAP (LAMBDA LISt (LAMBDA FN (CONS (FN (CAR LISt)) (MAP (CDR LISt) FN))))) 00:51:10 but I must say, it's really hard to implement call/cc in golang 00:51:20 only the first three characters of variable names are significant! 00:51:35 ok. speaknig of lisp implementations I wm trying to implement version of lisp on my own esolang 00:53:51 is set like scheme define? is ((lamba x(lambda y(foo))) bar baz) valid? 00:54:32 what I'd like is a top-of-the-line MMIX JITer 00:54:33 I'm not sure how scheme does things; set basically binds a name to a cons 00:54:57 and yes I think that's valid, it ought to produce foo, yes? 00:55:10 What I want is a compiler to compile LLVM to MMIX 00:55:29 zzo38: do you want to work together? 00:55:31 > log 00:55:32 Overlapping instances for GHC.Show.Show (a -> a) 00:55:33 arising from a use of `... 00:55:39 @type log 00:55:40 soundnfury: yes. it just seems strange. 00:55:41 forall a. (Floating a) => a -> a 00:55:52 adu: Work together with...? 00:55:58 i think original lisp called it SETQ 00:56:03 zzo38: me 00:56:06 nortti_: what's strange about it? 00:56:10 adu: For what? 00:56:20 zzo38: on an LLVM=>MMIX compiler 00:56:47 OK, maybe; but I am not very good at C++ 00:57:08 well, what are you good at? 00:57:13 soundnfury: shouldn't it be (((lambda x(lambda y(foo))) bar) baz) 00:57:36 I can program in C and in Haskell, and some others 00:57:48 zzo38: then let's write it in Haskell 00:57:52 * adu <3 Haskell 00:58:05 nortti_: yes actually, good point. 00:58:20 But doesn't it have to be in C++ if you want to write a LLVM backend? 00:58:29 so your original expression would produce Ly.foo 00:58:41 > log (1/81) 00:58:42 -4.394449154672439 00:58:46 because x would get bound to the list (bar baz) 00:58:47 > log 10 00:58:48 2.302585092994046 00:58:55 why am i taking so long to do this 00:58:56 adu: you want to write haskell with zzo38? how very brave of you. 00:58:56 urgh 00:59:01 ... I think 00:59:06 zzo38: that's only if you want to use their libraries, there are other ways of getting LLVM bytecode dumps 00:59:18 soundnfury: how does your MAP work? it has no checking for LISt being null 00:59:27 > 0.25 * ((log (1/81))/(log 10)) 00:59:28 -0.47712125471966244 00:59:37 and those LLVM bytecode dumps are all you need, you really don't need the libraries 00:59:53 nortti_: Answer: it doesn't 00:59:55 work, that is 01:00:08 because, as I think I mentioned, I've been making this dialect up as I go along 01:00:21 cuz if anyone really wanted to compile LLVM to MMIX, then they probably know how to do clang -o stuff, and cat a file 01:00:22 adu: Yes I know you can use LLVM bytecode dumps with anything (I have even written a program in C to read them once). But I thought you needed the libraries too for something; well, if you don't then now I know better 01:00:28 and when I wrote that example line in my notes, I hadn't defined any conditionals yet 01:01:00 > logBase 10 (1/81) -- *cough* 01:01:03 -1.9084850188786497 01:01:10 zzo38: there are C++ representations but text and binary should be good enough interfaces 01:01:38 zzo38: or did you mean compile MMIX=>LLVM? 01:01:53 There is already a compiler to compile C to MMIX (GCC does this); but if it is not C then you need LLVM->MMIX 01:02:01 adu: No, I mean compile a LLVM code into MMIX binary. 01:02:09 soundnfury: for my lisp implementations I use dialecr I call LIS because of my first lisp interpreter was names lis.py 01:02:11 ok, just checking 01:02:25 heh 01:02:44 I think I'd choose to use short-circuiting AND in my MAP 01:02:45 so... 01:02:54 adu: zzo38: i think there is at least one haskell library binding for llvm too 01:03:02 (Note: Haskell codes that I write tend to be different from other Haskell codes.) 01:03:03 -!- itidus21 has quit (Quit: Leaving). 01:03:29 (SET MAP (LAMBDA LISt (AND LISt (LAMBDA FN (CONS (FN (CAR LISt)) (MAP (CDR LISt) FN)))))) 01:03:42 that way (MAP NIL) is NIL 01:04:42 and as for the question about ((f x) y) versus (f x y), I've been changing my mind back and forth about that ever since I started 01:04:52 why not just use if? 01:05:02 AND is cuter 01:05:13 zzo38: www.lugod.org/presentations/Haskell_LLVM.pdf 01:05:16 * soundnfury comes from a C background 01:06:08 adu: Why do they all have to be presentations? 01:06:19 I thought you came from python background. and was used in place of if in some older python programs 01:06:39 here's another representative line: (set WHIle (lambda f (lambda g (and f (or g (WHIle f g)))))) 01:06:51 then python got (true if condition else false) 01:06:52 oerjan: oh zzo38's "Note", is that what you meant by "brave"? 01:07:47 soundnfury: where does g get executed? 01:07:48 nortti_: that's because python is /weird/. 01:08:27 I don't know. It's 2AM and I give up on Lisp for tonight 01:10:09 soundnfury: should it be (set WHIle (lambda f (lambda g (and f (or (eval g) (WHIle f g)))))) 01:10:44 soundnfury: * (set WHIle (lambda f (lambda g (and (eval f) (or (eval g) (WHIle f g)))))) 01:11:36 or is your lisp variant call-by-name? 01:13:31 Umm... I'm not entirely sure 01:13:55 My plan is to implement it first, then experiment with the implementation to see how it behaves, and maybe change the spec to match :S 01:14:21 This might not be the most successful project I've ever attempted 01:14:28 adu: Perhaps you tell me if you like or hate my Haskell codes; one program I wrote is the "dvi-processing" library. 01:15:25 zzo38: ok, I wrote language-go 01:16:54 -!- nortti_ has quit (Ping timeout: 264 seconds). 01:17:01 zzo38: looks well documented to me 01:17:05 They say it won't build 01:17:07 and idiomatic 01:17:49 "They"? 01:17:55 adu: yeah :P 01:19:25 Why do you say it is idiotic? Do you mean mine or yours? If you mean yours, I agree because they say it won't build. 01:19:52 idio_ma_tic *cough* 01:19:55 zzo38: "idiomatic" means it's good 01:20:07 it means it fits in with the style of the Haskell community 01:20:41 zzo38: oh mine won't build 01:20:47 I haven't updated it in a while 01:21:00 I will fix by 2013 01:21:05 OK 01:21:19 "idiomatic" and "good" are not completely equivalent, but for the purposes of creating non-write-only code it's a plus. 01:21:46 That's why I write idiomatic PHP. 01:21:56 * adu *shudders* 01:22:03 it helps if people can read the code you're writing. idioms are things that are (more or less) universally readable to anyone with knowledge of the language. 01:22:16 Well, some people hate my "dvi-processing" program, because I use explicit {;}, because I do not use do-notation, because they prefer PDF over DVI, because ... 01:22:33 bla bla bla 01:22:34 zzo38 has many enemies. 01:23:19 zzo38: haters gonna hate 01:23:21 If you want to make enemies, try to change TeX conventions. 01:24:27 -!- azaq23 has quit (Quit: Leaving.). 01:24:28 If you like this program, that is good. 01:26:09 Phantom_Hoover: like scribble? 01:26:25 I'm going to say 'yes'. 01:26:28 Yes. 01:26:53 \f[x]{y} <= TeX notation 01:27:00 @f[x]{y} <= Scribble notation 01:27:14 radical 01:27:20 o yeah 01:27:40 sorry no, this is too new and exciting for me 01:27:45 i need to have a cold bath 01:27:50 hahaha 01:28:08 In TeX you can change the category codes whatever you want, including part way through a file. This may be useful when you want to load external files which are stored in a different format. 01:28:25 http://docs.racket-lang.org/scribble/ 01:32:04 I have written some things with TeX, too. 01:33:41 Including: chess, Dungeons&Dragons, a program to include pictures on the page, a program to make binary specials, and this code-golf: \newcount\-\let~\advance\day0\loop~\-1~\day1~\mit\ifnum\-=3\-0Fizz\fi\ifnum\fam=5Buzz\rm\fi\ifvmode\the\day\fi\endgraf\ifnum\day<`d\repeat\bye 01:33:42 -!- DHeadshot has quit (Ping timeout: 264 seconds). 01:34:14 -!- DHeadshot has joined. 01:35:45 * soundnfury wonders if http://www.chiark.greenend.org.uk/~sgtatham/infinity.html might inspire any esolangs 01:35:48 (or already has...?) 01:42:10 Zeno machines are a fairly old way of getting around the halting problem. 01:42:42 So we can split any infinite stream of bits into two infinite streams by separating the odd bits from the even bits. Each of those streams, in turn, can be split. And so on - so we can have a binary tree of bit streams, all of which can fit in the Machine's memory without interfering with one another. 01:43:12 FWIW that doesn't lead to a binary stream, it leads to each bitstream having one bit at a finite index. 01:43:19 *binary tree 01:46:55 -!- adu has quit (Quit: adu). 01:59:18 I think he possibly meant a binary tree of bits 01:59:39 but he came up with a better system anyway 02:01:16 http://esolangs.org/wiki/V 02:02:52 -!- Canaimero-15d7 has joined. 02:03:17 -!- Patashu has quit (Read error: Connection reset by peer). 02:03:40 -!- Patashu has joined. 02:04:27 -!- itidus21 has joined. 02:07:01 -!- Canaimero-15d7 has quit (Read error: Connection reset by peer). 02:07:24 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 02:19:36 Hmm... I've had another language idea, and after a little investigation I've realised that the only way to make loops is with quines 02:20:01 it's a stack-based language, and instead of an "output" instruction it has an "append to the program" instruction 02:20:08 execution ceases when you run out of program 02:20:28 every instruction is a single character 02:20:34 but not every character is an instruction 02:20:39 those that aren't, get output 02:20:56 We can't say "Hello World" because that's got two 'o's and a 'd' in, both of which are instructions 02:21:13 but a similar program (and quine!) is: 'Sup, Earth 02:21:45 I'm now trying to write the nearest I can get to a cat program, which is one that reads in integers and writes out their binary expansions 02:22:33 so far I've got: ?`O`*`7`4`D`*`7`4`K`*`7`4`+`1`!`/`2`o`+`+`1`*`9`8`*`6`&`1`d74*D74*O 02:22:54 where "`x" is shorthand for "an arithmetic expression producing the ASCII value of 'x'" 02:26:33 Want to write an IF statement? Shove your body code onto the stack, turn your condition into (length of body or 0), remove that many items from the stack, output an appropriate number of items from the stack. Weep. 02:34:29 -!- DHeadshot has quit (Read error: Connection reset by peer). 02:34:34 -!- DH____ has joined. 02:35:04 -!- oerjan has quit (Quit: Good night). 02:41:33 -!- nortti- has joined. 02:47:06 -!- kallisti has quit (Remote host closed the connection). 02:47:44 -!- kallisti has joined. 02:47:44 -!- kallisti has quit (Changing host). 02:47:44 -!- kallisti has joined. 02:50:15 -!- itidus20 has joined. 02:51:04 -!- DH____ has quit (Read error: Connection reset by peer). 02:51:06 -!- itidus21 has quit (Ping timeout: 264 seconds). 02:55:57 Here we go... ?`O`*`-`+`1`!`f`*`2`*`*`1`7`7`1`*`2`*`*`1`7`7`K`*`+`1`!`f`*`2`*`*`1`7`7`*`2`*`*`1`7`7`D`*`*`1`7`7`I77*D77*O 02:56:07 reads a number and prints it out in unary 02:56:14 (caution: may not work) 02:56:34 -!- itidus20 has changed nick to itidus21. 03:15:38 I have reformatted the GPLv3 (for use in typeset documents), but made no modification to its text. Is this OK? 03:26:46 -!- DHeadshot has joined. 04:00:42 -!- DHeadshot has quit (Ping timeout: 264 seconds). 04:01:53 * itidus21 realizes he is reading a description of what is essentially a commandline driven paint program. 04:02:31 zzo38: I think so, but IANAGNUL 04:12:15 -!- edwardk has joined. 04:12:57 What commandline driven paint program? 04:19:31 -!- Patashu has quit (Ping timeout: 246 seconds). 04:19:52 YES! IT WORKS! ?`O`*`7`4`K`*`+`1`!`!`f`+`2`d`*`2`*`7`4`D`*`7`4`~`-`1`~`I74*D74*O 04:20:15 preprocessed form: 04:20:17 ?89*7+49*6+69*1+59*7+89*3+49*6+49*7+59*4+39*6+39*6+8d*1*49*2++49*7+59*5+8d*1*49*0++49*6+59*5+49*6+69*1+59*7+79*5+49*6+69*1+59*7+8d*1*69*8++59*0+59*4+8d*1*69*8++89*1+74*D74*O 04:20:18 Unknown command, try @list 04:21:03 -!- elliott has joined. 04:21:12 let's take an opportunity to honour the contributions of "R. Koot" to the wiki 04:21:18 http://esolangs.org/wiki/User_talk:R._Koot 04:21:19 http://esolangs.org/w/index.php?title=Fuckfuck&diff=prev&oldid=6135 04:21:22 bye 04:21:22 -!- elliott has left ("Leaving"). 04:22:47 -!- Patashu has joined. 04:27:34 -!- Dovregubben has quit (Ping timeout: 246 seconds). 04:28:30 -!- Dovregubben has joined. 04:30:00 -!- ogrom has joined. 04:42:03 -!- sirdancealot7 has quit (Remote host closed the connection). 04:44:13 monqy: what happened to your nose ! 04:44:29 what nose 04:44:53 : ( 04:47:00 it ran 04:47:19 -!- Dovregubben has quit (Ping timeout: 255 seconds). 04:52:45 How does it smell? 04:52:52 Terrible! 04:56:07 -!- ssue has quit (Ping timeout: 240 seconds). 05:00:15 -!- Dovregubben has joined. 05:22:03 -!- Otas has joined. 05:29:48 my terminal should have a keybind 05:30:02 that emulates yes 05:30:16 so I can immediately start confirming everything mid command invocation 05:32:33 I think that's activated by repeatedly pressing the y key as long as you want it to be active. 05:32:43 Well, y-enter. But anyway. 05:33:46 despite my most intense longing 05:33:51 I am not a yes emulator 05:34:06 because I feel discomfort in the task. 05:34:18 whereas a true yes emulator is without concern. 05:35:01 i don't think it's possible to specify concerns 05:35:21 your a concern. 05:36:08 it's a turing test kind of thing 05:36:42 I wish CPAN didn't test things. 05:36:50 it takes so long. :( 05:38:24 But then you would be UNCERTAIN. 05:38:33 i mean, it's not for me to say if caged chickens suffer waiting for me to eat them 05:39:07 the chicken parts of my brain understand chicken-suffering 05:39:10 and say that they do. 05:39:10 nor whether the errand boy's day is ruined by running my errands 05:40:01 that's a more less certain situation. 05:40:05 yes, more less. 05:40:13 it has more of less. 05:40:29 well, i try to be kind to the people who sort recyclables.. 05:40:41 how is that even related to the last thing you said. 05:41:08 its possible to make a real mess of what you put in the recycling bin 05:41:18 and the person who later has to sort it in a factory has to deal with the mess 05:41:37 factories are places where people make good money (?????????) 05:41:41 * kallisti says something 05:41:53 * kallisti says something else with topics loosely derived from the last thing said. 05:41:56 * kallisti ????? 05:41:57 * kallisti profits 05:42:20 my point is, do you really care if an original yes machine suffers discomfort? 05:42:27 no 05:42:43 ALL OF MY CODE CAN SUFFER. 05:44:03 i just don't like a specification based upon the discomfort of the system/machine 05:44:14 i love it.. 05:45:16 I'm mostly focused on avoiding my own discomfort.. 05:45:28 the jains argue it is better to pick a single fruit off a tree, than to shake the tree causing several fruit to fall. since you only intend to eat 1 05:46:18 <-- having another "crazy" day 05:46:30 so it's better to type yes by hand, than to have an infinite loop spam a buffer as fast as possible? 05:46:40 because the second is wasteful? 05:47:54 :-s 05:48:12 refer to channel topic 05:48:50 moo 05:50:45 http://gallery.trupela.com/albums/userpics/10001/normal_Moo.jpg 05:51:34 `apt-get moo 05:51:46 (__) \ (oo) \ /------\/ \ / | || \ * /\---/\ \ ~~ ~~ \ ...."Have you mooed today?"... \ W: Unable to read /etc/apt/apt.conf.d/ - DirectoryExists (2: No such file or directory) 05:52:01 The line breaks kind of mess that up. 05:52:20 anything to save me from my topic 05:52:25 -!- ssue has joined. 05:52:36 -!- sirdancealot has joined. 05:52:42 well, I think I can safely conclude that Eniuq /is/ difficult to program in 05:53:02 given that I've been working on my "print a number in unary" program for the last three hours 05:53:06 and it still doesn't work properly 05:53:20 soundnfury: sounds like it could be a hit then 05:54:21 indeed 05:54:24 Going purely on logic, and not as an any sort of assessment of personal skills or anything, but I don't think that's an entirely safe conclusion; it could always be just you. 05:54:46 http://jttlov.no-ip.org/tar/eniuq_0.1.src.tar.gz 05:54:48 fizzie: good point 05:55:01 Several things to note: 05:55:12 I'd have a look but I have to be in a train in twenty minutes or so. :/ 05:55:18 * the interpreter isn't anywhere near finished - many of the operators remain unimplemented 05:55:29 * there isn't any accompanying documentation 05:56:10 * the one program supplied doesn't exit cleanly; when it's done it produces a stack underflow error 05:56:26 * programs have to be run through the preprocessor `epp' by hand 05:57:14 clean exit is defined by stack underflow! 05:57:20 heh 05:57:32 just kidding.......... 05:57:51 the less input i have on actual serious esolangs the better 05:58:13 crazy input is *welcome* 05:58:22 but I already have a defined clean exit... 05:58:31 "empty instruction queue" 06:00:15 itidus21 is not yet learned in the ways of computer programming 06:11:36 I made the TeX calendar to include the preset month/weekday names of: \EnglishNames \CharlemagneNames \GermanNames \JulianNames \OldTurkmenNames \NewTurkmenNames \OldZorkNames \NewZorkNames 06:15:16 -!- augur has quit (Remote host closed the connection). 06:15:26 For preset list of special days you can use: \DiscordianTraditional \DiscordianModern \CanadaNationwideStatutoryHolidays \CanadaCommon \Alberta \BritishColumbia \Manitoba \NorthwestTerritories \Nunavut \Ontario \PrinceEdwardIsland \Saskatchewan \Yukon \UnitedStates \Japan 06:16:20 Is there any sun/moon ephemeris data that can be used with TeX? 06:29:09 -!- ion has joined. 06:33:41 -!- rolebot has joined. 06:36:17 -!- Otas has quit (Quit: Page closed). 06:38:44 $help 06:39:30 rolebot: help 06:39:51 hm 06:43:59 $frink 2 + 2 06:44:26 oh 06:44:31 +q? 06:45:36 -!- zzo38 has quit (Quit: Sorry, I quit.). 06:48:46 http://jttlov.no-ip.org/tar/eniuq_0.2.src.tar.gz 06:48:52 * all operators now implemented 06:49:00 * documentation has been written! 06:49:42 -!- MoALTz has joined. 06:51:01 (oh, in case anyone hasn't figured it out, "eniuq" is "quine" backwards) 06:51:39 -!- rolebot has quit (Quit: manual shutdown by kallisti). 06:52:28 -!- ais523 has quit (Remote host closed the connection). 06:52:39 -!- rolebot has joined. 06:52:45 -!- ais523 has joined. 06:52:45 -!- rolebot has quit (Remote host closed the connection). 07:10:13 -!- edwardk has quit (Quit: Computer has gone to sleep.). 07:17:09 -!- MoALTz has quit (Quit: brb). 07:29:13 -!- MoALTz has joined. 07:37:21 Yay, I've managed to make a version of unary.en that exits cleanly! 07:37:57 Unfortunately, if you input 0 or 1 you get nearly 2^32 digits output :( 07:38:29 but who cares, it works, and it's self-modifying quining code 07:39:10 the code: ?1-`+`3`*`4`8`k`D`+`3`*`4`8`+`*`*`3`d`5`*`4`+`1`!`f`+`3`*`4`8`~`-`1`~`I48*2+D48*2+O`Oo 07:55:46 does histogram ever mean a set of numbers independant of it's means of display? 07:56:20 it seems pretty obvious that it does based on a google result 08:02:55 Um, no, it doesn't 08:03:07 anyone who is using it to mean that is *wrong* 08:03:14 ok cool 08:03:18 ^_^ 08:03:27 and if they're appearing in a google result, then they must be *wrong on the internet* 08:04:26 its probably just me misinterpreting 08:05:31 heh 08:05:58 im doing something which to my mind is actually pretty cool 08:06:12 wossat? 08:07:47 disclaimer: i have never been employed in I.T., never completed a degree, no signifigant knowledge of mathematics, no real understanding of functional programming 08:08:18 my main interest is things related to computer games 08:08:31 so, i'm trying to think up a really clever 2d engine 08:09:01 -!- mtve has quit (Ping timeout: 244 seconds). 08:09:54 You could implement your game in Befunge... 08:10:01 that's already /got/ a 2d engine ;) 08:10:44 -!- mtve has joined. 08:15:53 brb 08:29:06 -!- AnotherTest has joined. 08:54:17 update to Eniuq; version 0.3 now out 08:54:28 http://jttlov.no-ip.org/tar/eniuq_0.3.src.tar.gz 08:55:07 * soundnfury is probably not up to the task of determining its computational class 08:55:29 it looks like it /should/ be TC, but I'm not good enough at writing quinescent code 08:57:55 -!- AnotherTest has left. 08:58:01 -!- AnotherTest has joined. 09:09:19 brb he says 09:33:53 -!- Jafet has quit (Ping timeout: 265 seconds). 09:34:03 -!- augur has joined. 10:04:06 -!- AnotherTest has quit (Quit: Leaving.). 10:54:19 -!- stlangbot has joined. 10:54:24 stlangbot: undf 65 10:54:24 [mroman] iiisdsi 10:54:28 stlangbot: dfa iiisdsi 10:54:28 [mroman] [] 10:54:30 stlangbot: dfa iiisdsio 10:54:30 [mroman] [65] 10:54:36 damn. 10:54:38 stlangbot: die 10:54:38 -!- stlangbot has quit (Client Quit). 10:55:06 -!- stlangbot has joined. 10:55:14 stlangbot: dfa iiisdsio 10:55:16 [mroman] 'A' 10:56:18 stlangbot: df iiisdsio 10:56:19 [mroman] [65] 10:57:00 stlangbot: stlang M .0III<+*D<+*I \ 10:57:00 [mroman] [65.0] 10:59:04 stlangbot: die 10:59:04 -!- stlangbot has quit (Client Quit). 11:05:57 -!- stlangbot has joined. 11:06:10 stlangbot: dfc iiisds 11:06:11 [mroman] M .0III<+*D<+* \ 11:12:48 -!- Phantom_Hoover has joined. 11:27:22 Phantom_Hoover: stop being so stupid. 11:27:32 your arguments are full of shit and you know it. 11:28:13 -!- stlangbot has quit (Remote host closed the connection). 11:28:57 -!- stlangbot has joined. 11:29:09 stlangbot: p 0+++*-*+@[ 11:29:10 -!- stlangbot has quit (Remote host closed the connection). 11:29:55 -!- stlangbot has joined. 11:29:56 stlangbot: p 0+++*-*+@[ 11:29:57 [mroman] AA 11:30:29 stlangbot: p 0+++*-*+@[d 11:30:29 [mroman] Timeout!ATimeout!Timeout!AATimeout!Timeout!ATimeout!Timeout!AAATimeout!ATimeout!Timeout!AATimeout!Timeout!ATimeout!Timeout! 11:31:50 stlangbot: die 11:31:50 -!- stlangbot has quit (Client Quit). 11:33:45 -!- stlangbot has joined. 11:33:48 stlangbot: p 0+++*-*+@[d 11:33:49