301 Moved

00:05:21 `run ls bin/*list* 00:05:23 bin/emptylist \ bin/list \ bin/liste \ bin/lists \ bin/makelist \ bin/olist \ bin/pbflist \ bin/slist \ bin/smlist \ bin/testlist 00:05:53 `cat bin/liste 00:05:57 echo Taneb atriq Ngevd Fiora nortti Sgeo alot monqy 00:05:59 `cat bin/list 00:06:01 #!/bin/sh \ oldpwd=`pwd`; cd /var/irclogs/_esoteric; name=$(cat $(ls ????-??-??.txt | tail -1) | tail -1 | sed "s/[^<]*.*//; s/.*\* //; s/ .*//"); cd $oldpwd; fgrep -q "$name" bin/list || echo -n "$name " >> bin/list; echo cuttlefish boily elliott Taneb HackEgo shachaf Sgeo monqy 00:06:08 `rm bin/list 00:06:11 No output. 00:06:13 `revert 00:06:16 Done. 00:06:51 `run rm bin/liste #IIRC this was the result of someone misunderstanding sed flag syntax 00:07:00 No output. 00:07:13 (specifically, that sed -ie is not equivalent to sed -i -e) 00:07:47 (the former uses the e as backup suffix) 00:08:06 `run ls bin/*e 00:08:12 bin/addquote \ bin/define \ bin/delquote \ bin/fortune \ bin/fueue \ bin/google \ bin/hyfinate \ bin/pastaquote \ bin/paste \ bin/quine \ bin/quote \ bin/relcome \ bin/resume \ bin/runce \ bin/shove \ bin/translate \ bin/wehlcohme \ bin/welcome 00:08:53 `cat bin/runce 00:08:54 #!/bin/bash \ t=`tempfile` \ echo "$@" | gcc -o $t -x c - 2>/dev/null && $t \ rm $t 00:09:04 `cat bin/runc 00:09:05 #!/bin/bash \ t=`tempfile` \ echo -e "$@" | gcc -o $t -x c - 2>/dev/null && $t \ rm $t 00:09:12 `rm bin/runce 00:09:15 No output. 00:09:33 `cat bin/relcome 00:09:35 #!/bin/sh \ welcome $@ | python -c "print (lambda s: ''.join([chr(3)+str(i%16)+s[i] for i in range(len(s))]))(raw_input())" 00:09:38 `relcome 00:09:41 /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: /hackenv/bin/relcome: Permission denied \ /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: /hackenv/bin/relcome: cannot execute: Permission denied 00:10:18 `sh bin/relcome test 00:10:19 sh: Can't open bin/relcome test 00:10:22 `run sh bin/relcome test 00:10:24 No output. 00:10:30 this is not the greatest script 00:10:35 you think 00:12:46 `run sed -i /shachaf/d bin/list 00:12:50 No output. 00:14:20 -!- augur has quit (Remote host closed the connection). 00:15:53 `cat /bin/list 00:15:55 cat: /bin/list: No such file or directory 00:15:59 `cat bin/list 00:16:01 #!/bin/sh 00:16:04 -!- sebbu2 has changed nick to sebbu. 00:16:04 `revert 3 00:16:06 shachaf: you fail at sed 00:16:08 `cat bin/list 00:16:15 ais523: um... you fail at `revert 00:16:17 err, yes 00:16:21 `help 00:16:22 Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/ 00:16:24 I thought that might be it 00:16:28 you need to look up revision on the site every time if you want to revert stuff 00:16:36 Done. 00:16:38 cat: bin/list: No such file or directory 00:16:49 oh well, you can revert my revert, right? 00:17:25 `revert 87c64ef250a0 00:17:26 or I can 00:17:39 ais523: I hope that isn't the revert commit 00:17:42 or in fact that won't even work 00:17:48 ais523: I think that command did what I expected. 00:17:48 "`revert rev" takes the revision _number_ (not hash) to revert _to_ 00:17:51 Done. 00:17:57 elliott: well it's not listing hashes 00:17:59 `ls 00:18:02 = 0 \ bin \ brainfuck.fu \ canary \ dbg.out \ egobot.tar.xz \ etc \ factor \ factor-linux-x86-64-0.95.tar.gz \ foo \ foo.err \ foo.out \ fueue.c \ ibin \ interps \ karma \ lib \ paste \ quines \ quotes \ quotese \ run~ \ share \ test \ u \ wisdom \ zalgo.hs 00:18:04 err, not listing numbers 00:18:05 just hashes 00:18:07 ais523: If you want something more fine-grained, feel free to do it yourself. 00:18:08 ais523: you click the commit 00:18:10 `cat bin/list 00:18:12 elliott: I did 00:18:14 it just gave me more hashes 00:18:17 #!/bin/sh \ oldpwd=`pwd`; cd /var/irclogs/_esoteric; name=$(cat $(ls ????-??-??.txt | tail -1) | tail -1 | sed "s/[^<]*.*//; s/.*\* //; s/ .*//"); cd $oldpwd; fgrep -q "$name" bin/list || echo -n "$name " >> bin/list; echo cuttlefish boily elliott Taneb HackEgo shachaf Sgeo monqy 00:18:19 ais523: "changeset :" 00:18:21 look closer. 00:18:23 anyway the revert to hash worked 00:18:24 `rm bin/list 00:18:28 No output. 00:18:35 `revert 00:18:38 Done. 00:21:09 anyway the revert to hash worked <-- wait it did? this changes *EVERYTHING* 00:21:26 that's a lot of change 00:22:00 as expected for a change all the way from revision 3. now why did i click that.. 00:24:20 had to kill my browser 00:24:32 `cat canary 00:24:45 foo 00:24:48 I'm wondering if /that/ changed too 00:24:51 apparently so 00:24:53 `run echo chirp >canary 00:24:58 No output. 00:25:02 `run hg diff 2116:2112 | paste 00:25:12 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.12699 \ 2116:2112: No such file or directory 00:25:26 ffff 00:25:56 oerjan: -r 2116 -r 2112? 00:25:58 or the other way around 00:26:31 `run hg diff -r 2116 -r 2112 | paste 00:26:41 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.12320 00:26:49 why did i have this memory of colon working... 00:27:48 oerjan: aliens planted it 00:30:16 anyway knowing that hashes work should make things easier. although it will make the resulting descriptions even harder to interpret. 00:31:32 ais523: although a plain `revert would also have worked - the other 2 commands made no changes 00:31:45 I didn't realise it skipped no-change commands 00:31:52 instead of `revert 3, that is 00:32:52 `perl -e 'print "testing\015ho"' 00:32:55 No output. 00:33:08 `perl -e 'print "testing\015ho";' 00:33:09 No output. 00:33:12 what 00:33:32 oh duh 00:33:37 you need `run 00:33:37 `run perl -e 'print "testing\015ho";' 00:33:39 testing 00:33:41 right 00:33:48 \015 is \r? 00:33:53 I'm more used to seeing it in hexadecimal 00:33:57 oh 00:34:04 ais523: yes i read them earlier 00:34:12 what did you think? 00:34:32 ais523: made sense to me. don't know if they'd make sense to a noobie though :P 00:35:04 ais523: do you think they are amenable to the color-coded symbol system? or if it does not encompass their strategies? 00:35:46 I forgot the color-coded symbol system 00:36:02 omnipotence can probably be described like that, at least 00:36:05 less sure about anticipation2 00:36:15 omnipotence is just a bunch of standard components glued together in a very nonstandard way 00:36:25 (poke + full-tape clear has probably never been tried before) 00:36:58 whereas anticipation2 is a synchronizing vibration program, the only other program like that is the original anticipation, as far as I know 00:48:23 hmm… you know those random dating adverts which have a "here are people living nearby" thing 00:48:35 I assumed that they were telling the technical truth, just not useful 00:48:48 but… I observed the same advert twice on the same page, same photo, different name 00:49:07 that seems to take more effort than doing it in a not easily disprovable way! 00:49:21 -!- DHeadshot has joined. 00:57:29 Ugh 00:57:36 hi 00:57:50 I really want access to a nice dynamically scoped way to fake being standard IO 00:58:49 Hmm, I see another way to solve my probkem 00:58:52 problem 00:59:14 That doesn't require some sort of library that makes it easy to write a shim I/O with multiple interpretations 01:00:12 -!- TeruFSX has joined. 01:03:33 -!- stuntaneous has joined. 01:04:53 elliott: oh, an observation I had a while ago: lexical scoping works by replacing the variable names as you enter and leave the scope, and dynamic scoping by replacing the variable values 01:05:02 so it's basically like scope-by-name, scope-by-value 01:05:06 I wonder if there's a scope-by-need 01:06:56 ais523: I dislike renaming-based reasoning 01:07:20 Quick, someone make a BF derivative that relies on renaming 01:07:20 -!- stuntane has quit (Ping timeout: 252 seconds). 01:07:21 I view explicit unstructured variable names like that as artefacts and definition in terms of them suspect 01:07:45 Piss off two people for the price of one 01:08:00 elliott: I know it's not a very /good/ view of lexical scoping, it's just a /possible/ view 01:08:16 sure 01:08:17 and I'm not saying this is going to be useful, I just saw a possible esoöpportunity 01:08:20 it is an interesting observation apart from that 01:08:26 scope-by-need sounds confusing 01:08:51 well, call-by-need is a transparent optimization for call-by-name right? 01:08:54 ais523: I just have an axe to grind, since I find the fact that people learn about alpha-renaming when introduced to the lambda calculus terrible beyond belief 01:09:06 so i imagine scope-by-need is like "don't allocate a new frame until the old one is written to" 01:09:11 a sensible optimization 01:09:15 kmc: no, it's not equivalent to call-by-name or call-by-value in an impure language 01:09:23 mmmmmm right 01:09:31 i guess most obviously, if you have an object-identity operator 01:09:33 in Haskell, it's only equivalent because all function calls are idempotent 01:09:37 wouldn't you need *scoping itself* to somehow be impure to distinguish this, then? 01:09:46 (and call-by-value is only different because of nontermination) 01:09:50 kmc: I forgot that most languages have object-identity tests :( 01:09:52 cough cough lazy blackholing of unsafePerformIO thunks 01:09:57 elliott: yeah, I think so 01:10:02 Function calls are idempotent? 01:10:16 if your language does dynamic scoping, the only way to determine the fact is by calling something in an outer scope 01:10:22 evaluation is idempotent 01:10:24 and seeing that it gets your variable rather than its variable 01:10:30 -!- stuntane has joined. 01:10:31 In Haskell everything is interchangeable with a value, right? At least outside of the IO monad 01:10:37 Ah, I suppose. 01:11:06 IO has nothing to do with it. 01:11:24 possibly unsafePerformIO has something to do with it, but IO itself doesn't 01:11:32 ugh 01:11:36 I thought, say, (car (1, 2), car (1, 2)) isn't optimized? 01:11:40 You could interchange io with a value too if that value somehow still had the side effects 01:11:41 what is car 01:11:45 fst 01:11:47 and what does optimisation have to do with it 01:11:55 Well, nothing observable 01:11:56 FreeFull: IO actions are values too. evaluating an IO action doesn't do anything special. only /executing/ the IO action has any side effect 01:12:10 the thing to focus on is not "pure vs impure" but "evaluation vs execution" 01:12:13 man this takes me back 01:12:15 and yeah, car is the Lisp name for fst 01:12:18 i gotta go pick up my nooooodles though 01:12:19 bbl 01:12:32 kmc: are those noodles made by nooodl 01:12:48 -!- stuntaneous has quit (Ping timeout: 240 seconds). 01:12:48 no they are made by Thelonious Monkfish 01:13:12 Does crashing vs not crashing due to poor algorithm count as observable? 01:13:40 yes 01:14:10 crashing is like non-termination for most purposes, except that you don't have to wait infinitely long to determine whether it's happened or not 01:14:26 So, if the fact that Haskell might do the same function evaluation twice (not memoizing by default) can be exploited into a crash where a memoized version wouldn't crash... 01:14:33 Observable memoization. 01:14:36 incidentally IO does break the semantics of the language 01:14:39 it can distinguish _|_s etc. 01:14:46 Sgeo: uh... 01:14:49 what 01:15:04 elliott: it's more a case of "some IO actions in the standard library break the semantics of the language", isn't it? 01:15:13 it's perfectly possible to imagine an IO that can't distinguish between bottoms 01:15:21 -!- augur has joined. 01:15:25 Or can lack of memoization only result in nontermination but not actual crashes? 01:15:33 kmc: Yeah, but you can't get a value out of an IO action without executing it, can you? 01:15:58 IO actions don't contain values in the first place. 01:16:13 How does IO distinguish bottoms? 01:16:13 You can build up another IO action that goes "imagine if we had a value from this IO action. I would like to do this with it" 01:16:26 shachaf: so IO String is a fake? 01:16:30 Everything is a lie? 01:16:31 FreeFull: there is no value "in" IO 01:16:41 @quote ls 01:16:41 dons says: - yeah, the idea is that you use the tools in the chapter 01:16:43 @quote /bin/ls 01:16:43 shachaf says: getLine :: IO String contains a String in the same way that /bin/ls contains a list of files 01:16:44 dammit 01:16:45 ais523: I am talking about Haskell, not an imaginary Haskell derivative 01:16:47 IO String does not contain a string. It is an action that describes how to obtain a string. 01:16:58 IO distinguishes bottoms by way of Control.Exception 01:17:12 e.g. observable sharing should also "be impossible" if IO were truly "kosher" 01:17:20 but these are not the details most people think about when they think IO is impure 01:17:24 It could presumably also "distinguish" them in some other ways. 01:17:45 Mostly more evil ways, though. 01:18:34 * oerjan thinks thelonious monkfish sounds like a member of the main girl genius villain family 01:19:32 -!- Phantom_Hoover has quit (Remote host closed the connection). 01:19:53 elliott: I was thinking about Haskell without access to certain libraries 01:20:06 I think exception handling is in the Report 01:20:09 which is certainly a legitimate language family (see, e.g., lambdabot) 01:20:15 but OK 01:23:35 ~eval 1 01:23:37 Hmm. 01:25:00 ~eval 3+3 01:25:04 Nope 01:25:36 hm that's spelled "mongfish" 01:27:28 -!- nollapiste has quit (Quit: Sto andando via). 01:41:23 Does there exist a transform of BF program to BF program such that a BF program that relies on 255 + wrapping to 0 or something can be made to run on an implementation that 255+ crashes on? 01:41:32 A mechanical transform 01:41:40 Yes. 01:42:04 you will have to add cells, though. 01:42:19 add cells? 01:42:21 Sure. 01:43:38 As in, I'm not sure what is meant 01:44:19 you cannot do it without adding memory bloat to get somewhere to put the necessary temporary cells for testing. 01:44:55 oh hm 01:45:38 a constant number is enough, although then you need to transform > and < as well to move the extra cells together with your pointer 01:46:10 oerjan: oh, and then you test the cell for each individual value to see if it's that value or not? 01:46:14 actually, not sure you can 01:46:23 how do you distinguish -255 from +255? 01:46:28 or are we assuming unsigned only? 01:46:42 i was assuming you could only use values 0 to 255, inclusive 01:47:08 Hmm, suddenly, I'm... not totally sure if... hm 01:48:09 Yeah, could work 01:48:16 if you have negative values as well, it will be harder. in fact then i don't think you can do it with constant number of cells, since you pretty much have to store whether a cell is positive or negative to avoid things going wrong at one end 01:48:17 Might need to transform : 01:48:40 * Sgeo is thinking in terms of Trustfuck 01:48:58 If the native Trustfuck BF implementation were constrained, writing a compiler for a variation that is not so constrained 01:49:16 i don't really feel like wrapping my brain around trustfuck right now 01:49:31 aww, darn >.> 01:50:29 I do feel like it's simpler than I made it sound. ! sends the code block to a compiler stack, which compiles into Trustfuck native primitives, which then get compiled to target 01:50:59 The resulting output has the current program on top of its compiler stack 01:51:09 when it itself runs 01:51:40 s/which compiles into/which collectively compile the code into/ 02:15:43 -!- monqy has joined. 02:21:37 Is it possible to make something like LLVM's "appending" linkage in GCC? 02:26:50 -!- ais523 has quit. 02:44:39 how does that linkage work? 02:59:34 Make multiple declarations of the array to be appending to put together. 03:01:55 i don't know how to do that at the symbol level with gnu toolchain 03:02:26 but sections of the same name get concatenated, and you can have arbitrary named sections in e.g. ELF 03:02:33 Linux uses this to good effect in many places 03:03:11 But can it be made to work on cross-platform? 03:03:19 Linux kernel code has a lot of macros that you put into your code which as a side effect output records into a table in some section 03:07:56 these are used for all kinds of fun things which i would be happy to blather on about at length 03:08:33 self-modifying code and stupid processor tricks 03:12:58 self-modifying code in the kernel 03:12:58 ? 03:13:16 Is it actually... used for important stuff? 03:13:27 Because there's a time and place to mess around, the kernel isn't it. 03:14:03 * Sgeo assumes that there is a good reason, otherwise it wouldn't be done. I hope. 03:14:09 Sgeo: tons of it, and yes they have good reasons 03:14:11 it's not "messing around" 03:15:01 for example, if you boot a SMP kernel on a uniprocessor system, it will go through and remove lock instructions / prefixes 03:15:01 and if you boot a kernel under paravirtualization, it will replace certain hardware operations with hypervisor calls 03:15:32 all of this enables distributions to maintain fewer binary kernels, while keeping things flexible and performant for users 03:15:50 Hmm, interesting 03:16:01 the kernel may be a bad place for 'messing around' but it's a good place for marginal performance improvements because they apply to /everything/ 03:16:37 more remarkably though, if you boot a multiprocessor system and then hot-unplug all but one CPU, it will /dynamically/ remove those lock instructions 03:16:43 and reinsert them if you bring another CPU online 03:17:31 self-modifying code is also used for debugging, tracing, etc 03:17:42 Hmm. How does one add locks where there weren't any? What if you're in a section that should have a lock around it when the new CPU comes on? 03:17:56 you have each function start with a call to a "record trace" function, but you nop those out unless tracing is enabled 03:18:08 much better performance than putting a conditional at the beginning of every function 03:18:35 in fact they have an abstraction for "immediate variables" which look like variables you can assign to, but actually they are load-immediates and each "assignment" rewrites every instruction that reads those "variables" 03:18:53 Sgeo: as to the first part, the locks were present in the compiled code, then they were NOPped out when you go to uniprocessor 03:18:57 so there is space to put them back in 03:19:07 as to the second, it happens in this wonderful function called stop_machine() 03:20:14 which gives you total control of all CPUs 03:20:19 so that nothing else is running concurrently 03:20:49 (My first "question" was just really about the second) 03:21:21 though those suspended processes still might be in the middle of some kernel function 03:21:21 when they resume 03:21:32 so i think you need to maintain certain properties about the code you're swapping out 03:21:59 executing a NOP; MOV which is in the middle of turning into a LOCK MOV is okay 03:22:06 because the NOP instruction and LOCK prefix are one byte each 03:22:13 (talking about x86 here as an example i know well) 03:22:23 (and because the most sophisticated tricks are for x86 and maybe ARM) 03:22:54 How can you expect that to work in a C program? 03:23:09 you don't; it's all done with inline assembly 03:23:22 Sgeo: here's the Linux kernel's big list of favorite NOP instructions: http://lxr.linux.no/linux+v3.7.7/arch/x86/include/asm/nops.h 03:23:32 "Note: All the above are assumed to be a single instruction. There is kernel code that depends on this." 03:23:45 that means you can replace them with a non-NOP of the same size without worrying about code that's in the middle of the instruction 03:24:25 Sgeo: it gets more complicated for something like Ksplice, which is swapping out an entire kernel function for another. Ksplice does stop_machine(), walks the kernel stacks of all processes, and aborts if any of them are executing one of the functions to be patched 03:25:34 depending on the patch and the workload of the machine this can actually make it rather hard to apply a patch 03:25:59 like on the super oversubscribed OpenVZ hosts running 1000 separate Apache processes, it would be pretty hard to patch bits of the network stack 03:29:07 Hard as in, takes time before there's a window of opportunity? 03:29:10 yes 03:29:33 the ksplice tools would retry periodically but sometimes it would take hours 03:38:28 -!- sivoais has quit (Remote host closed the connection). 03:39:34 -!- sivoais has joined. 03:45:49 `pastelogs ais523.*shove 03:46:22 No output. 03:46:27 `pastelogs ais523.*shove 03:46:48 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.27210 03:57:41 Do you know if it is possible in GCC to include a variable (possibly in its own section) which is accessed by a machine code for a different processor from the main program? 04:08:56 i don't understand 04:09:59 I mean without having to compile the other machine code within the C program, so it can instead be included in the compiled executable file. 04:20:33 -!- Arc_Koen has left. 04:39:35 C2 wiki mentions about three start programming, you might be a three star programmer ... if raw machine codes debugging is not low level enough. But now we have Verilog can we use that in such circumstances? 04:39:57 oh C2 wiki 05:06:14 -!- TeruFSX has quit (Ping timeout: 256 seconds). 05:33:12 zzo38: Why didn't you tell me curl supports gopher? 05:33:48 oerjan: Should I figure out what a limit is? 05:33:58 shachaf: how many buffer overflows in the gopher handlin 05:34:51 certainly 05:34:53 kmc: one more than you can handle 05:35:30 :O 05:36:38 Maybe buffer overflow in the curl gopher code are zzo38's secret weapon. 05:36:50 s 05:38:20 hax 05:38:36 kmc: are you drunk again 05:41:00 maybe he never stopped 05:47:30 no 05:51:23 adjunctions, man 05:57:15 shachaf: I don't know exactly why I will tell you that, and I also didn't know if there are buffer overflow in the curl gopher code. 05:57:35 But you can just download a gopher file using netcat very easily 05:58:01 what if there's a buffer overflow in the netcat gopher code 05:58:32 Netcat has no gopher code. 05:59:24 zzo38: Do you ever tell people to "gopher it"? 05:59:32 zzo38 peyton jones 05:59:36 No. 06:18:36 -!- copumpkin has quit (Ping timeout: 252 seconds). 06:19:11 -!- copumpkin has joined. 06:20:23 -!- pikhq has quit (Ping timeout: 252 seconds). 06:20:28 -!- pikhq_ has joined. 06:42:52 -!- pikhq has joined. 06:43:40 -!- pikhq_ has quit (Ping timeout: 272 seconds). 06:50:27 monqy: elliott is "holding me hostage" 06:50:32 i've heard 06:50:44 something about fake category theory 06:50:54 “why not try the real thing„ 06:51:22 because "the real thing doesnt have a type checker" 06:51:26 also "elliott hates maths' 06:51:44 shocking 06:52:20 um agda has a type checker 06:52:45 agda isnt" the real thing monqy" 06:52:56 :0 06:52:59 also i suggested agda and he said no 06:53:05 you write the real thing in agda 06:53:09 “duh„ 06:53:11 also does agda have gobby mode 06:55:04 good question 07:31:49 -!- Halite has joined. 07:41:00 I lost the source for NAND++'s interpreter :c 07:41:30 oops 07:57:12 -!- oklofok has joined. 08:02:00 -!- oerjan has quit (Quit: leaving). 08:12:12 -!- azaq23 has joined. 08:12:22 -!- azaq23 has quit (Max SendQ exceeded). 08:17:24 -!- DHeadshot has quit (Ping timeout: 272 seconds). 08:27:38 -!- Halite has quit (Remote host closed the connection). 08:45:38 -!- sebbu2 has joined. 08:45:53 -!- sebbu2 has quit (Changing host). 08:45:53 -!- sebbu2 has joined. 08:46:33 -!- sebbu has quit (Ping timeout: 272 seconds). 08:58:25 -!- quintopia has quit (Ping timeout: 246 seconds). 08:58:46 -!- quintopia has joined. 09:13:22 -!- epicmonkey has joined. 09:44:06 -!- sebbu2 has changed nick to sebbu. 09:47:09 A variant of UTF-18 could be made to allow surrogates to be used to encode code points which are out of range of UTF-18. (The ordinary UTF-16 surrogates would be used.) 09:48:40 What they call UTF-9 should be called VLQ-9 since it is actually VLQ and not UTF. 09:50:23 (Like UTF-8, it can be generalized to encode any numbers; it doesn't have to be Unicode at all.) 09:59:29 If it's an encoding for Unicode codepoints, it's a UTF, no matter how it can be generalized. (Of course they could have a name such as VLQ-9 for the encoding in general, and then specify UTF-9 as simply using it.) 09:59:35 -!- monqy has quit (Quit: hello). 10:04:48 -!- DHeadshot has joined. 10:13:18 -!- Nisstyre_ has joined. 10:14:47 -!- Nisstyre has quit (Ping timeout: 240 seconds). 10:23:25 -!- DHeadshot has quit (Ping timeout: 260 seconds). 10:30:52 I should make the program to print out the file of Internet Quiz Engine to fill out the quiz on paper. 10:31:53 First I should fix the analysis program. 10:33:54 On the C2 wiki I found that Visual Basic 9 has command like: Dim query = From token In tokens Group By token Into Count() 10:45:27 That's the release where they added LINQ, I think. 10:57:39 -!- carado has joined. 10:59:56 -!- oklofok has quit (Ping timeout: 255 seconds). 11:17:27 -!- Phantom_Hoover has joined. 11:28:02 -!- nooodl_ has joined. 11:29:52 `WELCOME nooodl_ 11:29:57 NOOODL_: 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.) 11:32:07 thanks 11:32:13 `THANK elliott 11:32:15 /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: THANK: not found 11:33:10 hi nooodl_ 11:35:34 Do you like "worse-is-better"? 11:35:59 hi shachaf 11:43:14 -!- nooodl_ has quit (Ping timeout: 272 seconds). 12:36:34 http://sprunge.us/OaVJ "The problem is, the Wotan German AI holds the manifest destiny of becoming so smart in the future that humans will not so much "use" Wotan as co-operate with Him or even be subservient to Him." 12:36:41 (comp.lang.forth strikes again.) 12:46:33 -!- TeruFSX has joined. 13:24:14 -!- boily has joined. 13:27:43 all hail wotan 13:27:46 god of the electron 13:28:13 * boily checks his calendar. hm. not Friday yet. 13:28:43 could someone here be amiable enough to please explain the link between a subatomic particle and a norse god? 13:29:16 (and if anyone points that electrons are probabilistic waves, I'll get quantic on their puny meatbody.) 13:33:12 -!- Taneb has joined. 13:33:24 -!- impomatic has quit (Quit: Core War - the ultimate programming game http://corewar.co.uk). 13:33:47 -!- TeruFSX has quit (Ping timeout: 252 seconds). 13:40:54 -!- ssue has quit (Ping timeout: 264 seconds). 13:41:13 -!- ssue has joined. 13:43:51 note to self: don't read reddit threads on the dorner siege 13:53:09 -!- Taneb has quit (Quit: Page closed). 13:56:26 -!- cuttlefish has joined. 14:02:38 -!- ogrom has joined. 14:25:21 -!- Taneb has joined. 14:37:27 http://www.chrisseaton.com/katahdin/ 14:46:32 -!- ais523 has joined. 14:46:46 @messages? 14:46:46 Sorry, no messages today. 14:48:34 Oh no! 14:49:16 -!- Taneb has quit (Quit: Leaving). 15:03:12 -!- Gregor has quit (Ping timeout: 264 seconds). 15:03:19 -!- Gregor has joined. 15:03:44 -!- Gregor has changed nick to Guest92969. 15:04:08 -!- Guest92969 has changed nick to Gregor. 15:07:19 -!- Taneb has joined. 15:07:22 Is that a different message than the usual, or does it just have multiple, or do I just misremember? 15:07:25 @massages? 15:07:26 Sorry, no messages today. 15:07:27 @massages? 15:07:27 Sorry, no messages today. 15:07:31 Seems pretty fixed. 15:07:40 Maybe it's the usual and people just rarely use the ? form. 15:08:07 @help messages 15:08:07 messages. Check your messages. 15:08:11 @help messages? 15:08:11 messages?. Tells you whether you have any messages 15:08:38 @help messages? 15:08:38 messages?. Tells you whether you have any messages 15:21:00 I wonder if I'll ever make use of the ST monad 15:26:24 -!- DHeadshot has joined. 15:31:32 -!- impomatic has joined. 15:37:07 -!- ogrom has quit (Quit: Left). 15:41:32 You have said about materialism is "everything is physics", but what is it called "everything is mathematics"? 15:42:02 Mathematical realism or something 15:42:45 Possibly Pythagorianism, but that one has a mystic vibe to it 15:42:54 Pythagorianism is weird 15:43:56 Mathematics isn't restricted to describing reality though 15:44:10 It describes things that aren't real just as well 15:44:28 i'm cool with the whole "even numbers are female" or whatever thing they had 15:44:33 -!- Arc_Koen has joined. 15:45:03 Which one is the sexiest? 15:45:14 I thought that was the Chinese 15:45:40