00:01:48 -!- lament has quit (Ping timeout: 252 seconds). 00:02:11 -!- lament has joined. 00:05:44 -!- MizardX has quit (Ping timeout: 256 seconds). 00:14:39 -!- FireFly has quit (Quit: Leaving). 00:22:40 -!- Gracenotes has joined. 00:39:59 -!- MizardX has joined. 01:24:11 -!- jcp has joined. 01:25:28 ok guys, i have a crazy brilliant idea or something 01:25:42 a type of machine code which uses something like LZW compression 01:26:12 so that it's really really compact 01:29:35 How to handle jumps? 01:31:31 decompression is done JIT 01:32:43 -!- MissPiggy has quit (Quit: Lost terminal). 01:34:08 * oerjan inserts funny comment about x86 already working like that 01:36:12 -!- adu has joined. 01:36:14 hi 01:36:25 hi adu 01:36:37 * oerjan vaguely recalls you from before 01:36:40 how goes? 01:36:52 yes, i was here 2 months ago, and 6 months before that 01:37:14 I've been doing naughty things 01:37:21 quiet at the time, lots of befunge discussion earlier today 01:37:28 nice 01:37:37 * adu <3 <3 Funge-98 01:38:22 i honestly don't know why people still make new VMs, Funge-98 is the most universal extensible VM out there 01:38:30 cpressey (the inventor) has recently started coming here again 01:38:35 cool 01:40:40 oh right gm|lap just said something about compressed machine code 01:40:52 so not entirely quiet 01:41:07 i like machine code 01:42:29 have you heard of VSM? 01:43:26 no 01:43:36 http://en.wikipedia.org/wiki/Viable_System_Model 01:44:26 I've been considering making a VM for it, although the name VSM-VM might be confusing... 01:45:39 mhm 02:10:17 -!- songhead95 has joined. 02:10:29 Hello World! 02:10:49 I am not the world! 02:11:46 Oh! 02:12:40 Has anyone seen the language I posted? 02:12:44 WTFZOMFG 02:14:39 ? 02:15:49 -!- songhead95 has quit (Quit: Java user signed off). 02:15:58 -!- songhead95 has joined. 02:16:04 Okay 02:16:11 -!- songhead95 has quit (Client Quit). 02:16:21 -!- songhead95 has joined. 02:16:30 -!- songhead95 has quit (Client Quit). 02:17:21 Curious. 02:21:47 -!- songhead95 has joined. 02:22:04 hello, my IRC crashed 02:22:15 *irc client 02:22:27 /kill songhead95 goodbye, my client didn't 02:22:45 wait what? 02:23:32 oh I see what you did there 02:24:23 Hmm. Looks to me like an IRC noob. 02:24:31 yes sorry. 02:24:35 Hello there, and welcome to Internet Relay Chat. 02:24:58 ah 02:27:42 ...so yes I am a noob 02:28:34 ようこそう、ね。 02:30:00 私は歓迎するが、感じがわからない日本語 02:30:28 Hah. 02:30:34 so I use google translate 02:30:56 Heheheh. 02:31:06 Yeah, figured. 02:31:30 That's some exceptionally weird grammar there. 02:31:59 mhmm sometimes I translate something in google translate to like 6 languages, then get it back to english 02:32:29 Eventually "What is a man? A dirty pile of lies!" turns into "How many? A pile dirty secret!? 02:35:31 Hmmm... could google translate be turing-complete? Looks like a job for esolangs! 02:36:02 No. 02:36:38 Sorry if I make stupid jokes. I am a noob to chat alltogether 02:36:47 Is okay. 02:36:58 Most of us were noobs at some point. 02:37:11 And stupid jokes are almost a pastime on IRC. 02:37:18 (seriously, have you read bash.org?) 02:38:13 Lol I haven't before but that is really funny! 02:40:06 I have to go learn the ways of the chat, and then come back when I am a master. bye :) 02:40:11 -!- songhead95 has left (?). 02:40:16 -!- Asztal has quit (Ping timeout: 256 seconds). 02:40:21 ... 02:40:29 I don't think he realises the way to do that is be in chat. 02:41:01 some people _do_ try to read the manual first 02:41:46 oerjan: There's a manual? 02:41:55 Sure wasn't when I IRC'd. 02:42:21 i assume that would be bash.org. i haven't read it myself. 02:42:39 The IRC RFC :P 02:42:42 * oerjan whistles half-innocently 02:42:56 i almost read that 02:43:13 Gregor: Ah, that. 02:43:26 oerjan: bash.org is a major IRC quote server. 02:44:06 i may have had a slight suspicion of that fact. 02:45:18 There are never any new quotes in the top 100 02:45:19 :( 02:45:35 qdb.us is a modicum better than bash.org 02:46:02 More actively maintained, at least. 02:52:22 Huh. Until now, I thought Ocarina was a made up .. word thingy for some game 02:52:30 Nope. 02:52:35 Genuine musical instrument. 02:52:48 And not invented for the game either, according to wiki 02:52:55 Yup. 02:53:36 octarine is made up, however. 02:54:30 * Sgeo shouldn't have had to Google that 02:54:33 It's been a while 02:55:17 -!- Pthing has quit (Remote host closed the connection). 02:59:00 -!- Sgeo has quit (Read error: Connection reset by peer). 02:59:22 -!- Sgeo has joined. 02:59:30 * Sgeo blames http://qdb.us/140717 03:02:01 -!- augur has joined. 03:05:05 -!- charlls has quit (Read error: Connection reset by peer). 03:05:22 -!- charlls has joined. 03:17:11 "THE COMMUNISTS HAVE CONTROL OF GRAND CENTRAL STATION AND THEY WILL BRING THE COMMIE TRAINS TO TOWN! WE MUST WARN THE MAYOR CHOO CHOO" 03:26:35 -!- jcp has quit (Read error: Connection reset by peer). 03:27:44 -!- jcp has joined. 03:31:37 http://shii.org/knows/Zybourne_Clock 03:31:53 Imagine four balls on the edge of a cliff. Say a direct copy of the ball nearest the cliff is sent to the back of the line of balls and takes the place of the first ball. The formerly first ball becomes the second, the second becomes the third, and the fourth falls off the cliff. Time works the same way. 03:46:10 * Sgeo gets confused at 2^O(c^n) 03:51:15 i guess it means that the _logarithm_ is O(c^n) 03:52:35 which is not the same as O(2^(c^n)) 03:52:38 * Sgeo is still confuzzled 03:52:55 for example, 3^(c^n) is the former but not the latter 03:53:41 * Sgeo is too tired to think right now 03:54:00 because 3^(c^n) = 2^(logBase 2 3 * c^n), so just a constant multiplier after you take the logarithm 03:55:14 while before, it is an extra power - 3^(c^n) = (2^(c^n))^(logBase 2 3) 03:56:12 * Sgeo isn't even looking right now 03:57:08 http://asset.soup.io/asset/0453/8747_0991_800.png 04:02:47 bsmntbombdood is on qdb.us! 04:04:18 shocking! 04:04:25 (where?) 04:05:33 http://qdb.us/71165 04:07:46 word of god, that 04:10:14 -!- adu has quit (Quit: adu). 04:15:15 I got spam mail in base 64. 04:19:08 -!- adu has joined. 04:22:49 Sgeo: more than once 04:28:02 Sgeo: Yeah, most IRC denizens are. 04:28:18 * Sgeo looks for himself 04:28:29 *gasp* 04:29:01 I'm in 2 quotes (and a third that wasn't actually me) 04:29:08 All 3 are apparently sucking 04:29:17 http://qdb.us/264456 This one's a better quote, anyways. 04:29:18 The one non-me is the only one that's not negative 04:29:33 http://qdb.us/search?q=Sgeo&order=real_score&sort=desc&limit=25&approved=-1 04:32:21 http://qdb.us/301257 Freaking zzo38. 04:32:43 -!- MizardX has quit (Ping timeout: 276 seconds). 04:33:35 wait i searched for myself and got no results, but there i am? 04:34:16 * Sgeo mindboggles at zzo's choice of client 04:37:02 heck even i couldn't vote for that mess, and i seem to be the joke maker 04:38:10 I'm on 0 04:38:23 not even on bash 04:41:38 -!- augur has quit (Ping timeout: 265 seconds). 04:58:20 -!- gm|lap has quit (Quit: 2 hour UPS expired. Shutting down laptop.). 05:01:23 -!- oerjan has quit (Quit: Good night). 05:03:17 -!- adu has quit (Quit: adu). 05:30:02 -!- augur has joined. 05:51:29 -!- EvanDonovan has joined. 05:54:51 -!- EvanDonovan has quit (Quit: ChatZilla 0.9.86 [Firefox 3.5.8/20100202152834]). 06:49:15 -!- jcp has quit (Quit: I will do anything (almost) for a new router.). 06:51:15 -!- FireFly has joined. 07:04:15 -!- tombom has joined. 07:07:06 -!- coppro has quit (Quit: I am leaving. You are about to explode.). 07:24:08 -!- kar8nga has joined. 07:50:58 -!- tombom has quit (Quit: Leaving). 07:52:33 -!- FireFly has quit (Quit: Leaving). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:28:50 -!- adam_d has joined. 09:10:41 -!- amca has joined. 09:17:58 -!- amca has quit (Ping timeout: 245 seconds). 09:20:19 -!- amca_ has joined. 09:24:04 -!- amca_ has changed nick to amca. 09:28:25 -!- chickenzilla has quit (Ping timeout: 264 seconds). 10:08:07 -!- chickenzilla has joined. 10:42:59 -!- BeholdMyGlory has joined. 11:49:53 -!- oerjan has joined. 12:13:42 Esolang: Each cell in field can hold 32-bit number, and there are 32-bit registers R0 and R1. IP travels on the field and if cell it lands on contains valid instruction, it executes it... 12:14:04 Instructions: Unconditional turn to cardinal direction, and the same on condition that R0 != 0. 12:14:31 ... Rotate R0 left by 1 place. NAND R0 and R1 and store to R0... 12:14:59 And instructions to store/load R0/R1 from one of cardinally adjacent to IP cells. 12:15:32 Plus of course print R0 as character, read character to R0 and exit instructions. 12:43:27 -!- amca has quit (Quit: booork). 12:51:56 -!- kar8nga has quit (Remote host closed the connection). 12:52:58 -!- MissPiggy has joined. 12:58:32 -!- BeholdMyGlory has quit (Remote host closed the connection). 13:17:10 -!- Pthing has joined. 13:34:41 want to tell OKLOPORK 13:34:42 GRRR 13:44:04 -!- LemmingLemming has joined. 13:45:00 -!- LemmingLemming has quit (Client Quit). 13:49:33 -!- oerjan has quit (Quit: Later). 14:03:45 -!- MizardX has joined. 14:43:21 -!- oklopol has joined. 14:43:52 heh, uni friend wrote this interpreter thingie in clue, reading the language is like solving a fucking puzzle :P 14:44:17 (i guess that's sort of obvious) 14:55:10 oklopol, which language? 14:55:21 clue? 14:55:26 as in, self-interpreter? 14:57:22 wait what? That doesn't seems plausible for http://esolangs.org/wiki/Clue 15:01:03 other clue 15:01:03 and no not self-interpreter, just an interp for some random language 15:01:03 (actually the language called random, pun not intended) 15:01:23 heh 15:01:41 :) 15:01:53 oklopol, is either of those on the wiki? 15:02:08 http://esolangs.org/wiki/Random ? 15:02:11 as in, that one? 15:02:23 i didn't put any sort of comparison in the language, so he added another function for that for speedness; i just knew it was comparison, but not whether a 1 or a -1; cool thing is with clue, both work 15:02:34 yeah that's the language he made the interp for 15:02:38 in clue 15:02:40 oklopol, and in which clue? 15:02:46 if it wasn't the one on the wiki 15:02:53 as in, spec for the other clue 15:02:55 clue is not on the wiki yet, but it will be once i find the time to make a small spec. 15:03:07 oklopol, or do you mean the game Clue? 15:03:14 although it seems you can just pick up the language from the ski interp 15:03:28 no, my language clue i've been talking about for like years 15:03:34 oh 15:03:36 :P 15:03:51 oklopol, maybe another name to not collide with the existing language clue? 15:04:08 -!- cpressey has joined. 15:04:12 1. i had the name first 2. why not collide? 15:04:23 3. for my language, the name makes sense 15:04:32 cpressey, btw I think I worked out how to do *W butterfly for bignum in a sensible way 15:06:39 cpressey, basically, you use the smallest fixnum that could fit it, rounded up to 32*(2^n) where n is a positive integer. 15:07:00 well, positive or 0 15:07:34 cpressey, of course the results in most fixnum interpreters will vary depending on if they use 32-bit or 64-bit cells 15:07:39 so the operation is pretty useless for those 15:07:42 non-portable 15:08:03 (other cell sizes would cause similar problems of course) 15:10:19 haha, this is actually so cool, you can, to some extent, just change whatever conventions you wish in the stdlib, and chances are programs will still work 15:10:30 oklopol, in what language? 15:10:45 for instance, you can permute any function's parameter list in absolutely any way, and it's guaranteed no function can break 15:10:49 AnMaster: okay what the fuck 15:11:04 i have not, do not, and will not, ever, talk about any language other than clue 15:11:30 oklopol, oh? what about oklotalk? 15:11:35 you talked about some time ago 15:11:39 and lots of other languages 15:12:05 or did you mean "today"? 15:12:14 well so's your face 15:12:14 can permute parameters! 15:12:45 oklopol, how do you ensure this property? Named parameters? 15:12:59 well you can't actually call a function in clue 15:13:16 okay that helps 15:13:27 then bf have the same property! 15:13:56 it doesn't even *have* functions so every property of the functions that don't conflict with not having functions is true there! 15:14:22 well if you consider the bf instructions the functions, then clearly you can call them, if you consider only functions functions, then yes, bf has the same property, it's just en empty property because there are no functions. 15:14:27 yep 15:14:54 but i think the property is more interesting when it actually means something 15:17:31 oklopol, then how do you use the functions in question in clue? 15:17:34 if you can 15:17:45 can't* call the functions it *seems* to be a fairly useless property 15:18:47 well you see the paradigm is you give examples of computation, and you give functions the compiler can use 15:18:48 I assume you do something tricky that actually makes it possible to somehow pass parameters to a function and cause it to execute sometime during the program run 15:18:52 and it finds an implementation 15:19:12 so you can not in any way rely on specifics like the order of parameters 15:19:36 oklopol, does it error out if there is more than one possible function matching it? 15:19:59 well there would always be unless you define all possible combinations of parameters 15:20:02 as examples 15:20:07 no, it returns the first one it finds 15:20:14 it's not specified which one 15:20:35 what did you mean by that combination thing 15:20:43 oklopol, so does it interpolate the values between the examples? 15:20:56 what does that mean? 15:21:14 it just brute-forces definitions until it finds one that fits. 15:21:39 or at least it's not required to do anything more intelligent 15:22:10 oklopol, well, like say: sin(0)->0; sin(pi/4)->1/sqrt(2) sin(pi/2)->1 15:22:23 and it takes an average if given pi/6 or such 15:22:28 you can study my ski interp if you want to learn more. 15:22:39 err 15:22:39 no, that would be silly 15:22:45 oklopol, hm, nah you could give an example of what you mean 15:22:52 oklopol, weighted average of course 15:23:25 hey, if a random uni dude could reverse-engineer the language in a few hours, i'm not even sure i'm ever gonna make a spec :) 15:23:59 i can show you the append function maybe 15:24:10 oklopol, "a random" <-- insert joke along the lines if he designed that language 15:24:20 oklopol, that should be interesting 15:24:22 append ~ ; car; cdr; cons 15:24:39 means "append uses the functions car, cdr and cons, and its condition function is 'empty'" 15:24:48 then 15:25:09 append ~ {. [], [1, 2, 3] -> [1, 2, 3] . [], [4] -> [4] } 15:25:13 two examples of the base case 15:25:18 (separated by .) 15:25:28 mhm 15:25:42 append ~ {:. [1,2,3],[4,5,6] -> [1,2,3,4,5,6] : [2,3],[4,5,6] -> [2,3,4,5,6] } 15:26:01 example of recursive case, with :. being the call, : being the subcall 15:26:05 ah 15:26:18 that's it basically 15:26:27 oklopol, are there just those in the code or are there more examples you didn't paste here? 15:26:47 that's the whole append, you can write a shorter one ofc 15:27:03 oklopol, how do you call it or whatever later 15:27:03 as in 15:27:15 example of how it is used 15:27:33 well say you want a function that appends lists together 15:27:42 well you have that there don't you? 15:27:52 then you might have multiappend ~ ; append; ... 15:27:59 hm? 15:28:00 oh sorry 15:28:08 i mean an arbitrary amount of lists 15:28:20 [[1,2],[3,4],[5,6]] -> [1,2,3,4,5,6] 15:28:22 concat 15:28:25 oklopol, I mean example of how you cause two specific lists to be appended 15:28:29 to each other 15:28:36 you can't do that 15:28:44 oklopol, well, what about from user input then? 15:28:47 or something 15:28:55 well you could write a function that appends two lists and returns the result 15:29:07 oh well i haven't decided yet, probably there's a main function that takes user input as a list 15:29:12 oklopol, fine. What would it look like if it was supposed to use that function "append" 15:30:09 oklopol, basically: lets say I somehow want to use your append function above to make the language calculate what appending [9,-3,4] to the end of [27,22,3] is 15:30:26 that is, getting the result [27,22,3,9,-3,4] 15:30:43 oklopol, using your above append function of course :) 15:30:48 that is what I'm wondering about 15:31:12 i think this should work 15:31:12 multiappend ~ {. [] -> [] } 15:31:15 multiappend ~ {:. [[1,2], [3,4]] -> [1,2,3,4] : [[3,4]] -> [3,4] 15:31:15 :. [[],[1],[]] -> [1] : [[1],[]] -> [1]} 15:31:15 multiappend ~ ; append; cons; car; cdr 15:31:53 oklopol, yes, and where do the data I provided go into that? :) 15:31:56 well you'd call the compiled function append, prolly 15:32:13 oklopol, eh? 15:32:18 you can put data into the functions by calling the python functions the compiler returns. 15:32:23 aha 15:32:25 that's really a non-issue. 15:33:24 oklopol, so it would work for that example above? It would be able to figure it out? Even using lists of different lengths too? Like appending to [27,22,3,472,283,172,3872] instead of that one above? 15:33:40 yeah that should work for all lists of lists. 15:33:47 i can test it ofc 15:34:08 oklopol, err the original append function you gave doesn't take a list of list does it? 15:34:13 it takes two lists it seems 15:34:22 now I'm confused 15:34:38 oklopol, also how does the parameter order to it not matter, that I'm interested in too 15:35:55 [[1,2,3],[2,3],[3]] --> [1, 2, 3, 2, 3, 3] 15:35:59 seems to works 15:36:01 *work 15:36:18 had one error, the function that tests if a list is empty is called "empty", not "empty?" 15:36:34 AnMaster: well consider cons 15:36:50 i just give cons as a helper function, "you can use this function in any way, if you find it necessary" 15:36:54 if you swap the args to cons 15:36:55 hm 15:37:04 then the compiler will just use it, but swap the arguments. 15:37:16 oh? 15:37:33 well okay, in some cases it might find some other function first, because swapping the args made it harder for it to find the correct implementation 15:37:57 oklopol, I mean, append([4,5,6],[1,2,3]) seems like it should give a different result than append([1,2,3],[4,5,6]) 15:37:58 but sofar no function has bee incorrectly implemented, all errors have been mine 15:38:13 well actually i don't think i've made any errors 15:38:20 oh well sure 15:38:43 but see 15:38:46 if i had append in a program 15:38:50 and i reversed its arguments 15:39:00 then all functions that use append would just be compiled with the new order of arguments 15:39:07 hm okay 15:39:16 otherwise they would be wrong, so the compiler would have to reverse them. 15:39:24 ah hm 15:39:43 oklopol, I guess compiling can take quite a bit? 15:39:53 even for fairly simple functions 15:39:54 0.13 seconds to compile the multiappend thing 15:40:00 9 seconds to compile my ski interpreter 15:40:06 1 second to compile the random interpreter 15:40:09 hm 15:40:18 so yeah, a fuckload of time for even simple tasks 15:40:34 but it's just a crappy python hack 15:40:37 the interp 15:40:42 well, yes considered how long it would take for most compilers 15:40:55 possibly you might beat g++ but that is all ;) 15:41:12 oklopol, is the source code for the interpreter online? 15:41:16 well 15:41:22 interpreter/compiler I guess 15:41:28 maaaybe i could put it up 15:41:59 oklopol, you should probably wait until you wrote a rough spec so you don't get everyone asking you to explain how it works ;) 15:45:13 i'll put the ski interp online too, you can just read that 15:45:22 for teh idiomatic clueness 15:45:46 oklopol, well, I suck at ski.. 15:46:03 okay i just more than doubled all compilation times by adding a tiny fix :) 15:46:33 oklopol, always keep falling when skiing downhill. I'm reasonably okay at it on mostly flat ground 15:46:45 now it can call a function with many copies of the same objec 15:46:45 t 15:46:45 flat is nicer 15:46:52 also called cross-country 15:46:56 oklopol, yep 15:47:05 I don't fall all the time there 15:47:31 and I'm scared of heights, which doesn't really help avoiding falling when going downhill 15:48:03 but, many of the helper functions i wrote are pretty basic and not ski-specific 15:48:03 how can you fall? 15:48:04 move your legs man 15:48:26 oklopol, err? I said when going downhill 15:48:29 not when cross country 15:48:41 still 15:49:10 still what? 15:50:03 -!- adam_d has quit (Ping timeout: 245 seconds). 15:51:34 -!- scarf has joined. 15:51:38 hi scarf 15:52:54 -!- kar8nga has joined. 15:58:48 AnMaster: do you open rar? 15:59:31 well anyway www.vjn.fi/oklopol/clue.rar 15:59:46 i'll make a spec and put it on esolang during march, hopefully 16:01:38 i'm assuming there won't be a massive surge of programs making that a de facto standard or anything. 16:02:55 hi everyone 16:03:09 CLUE INTERPRETER NOW ONLINE SOURCE SORT OF OPEN TOO. 16:03:17 link 16:03:27 www.vjn.fi/oklopol/clue.rar 16:03:55 oklopol: ooh 16:04:01 as i mentioned, someone reverse-engineered the ski-interp and wrote a random interp, so i'm assuming anyone who wants to play can just do that as well. 16:04:21 random, again, being the language random on esolang 16:05:03 the parser is not very good, it works pretty well as long as you don't make any errors, but doesn't really help you locate them. 16:05:20 wow at that SKI 16:05:50 is there anything significant at all in the identifier names? or are they just compared for equality? 16:06:15 just compared for equality 16:06:39 and are presumably builtins? 16:06:44 i might make identifier name matching fuzzy, because i typo them a lot and forget whether i had a "?" in the end, and they are always pretty long. 16:06:47 yep 16:06:55 stuff.py contains a list of builtins 16:06:56 and cons/car/cdr are library functions? 16:07:10 there are just builtins 16:07:15 ah, ok 16:07:16 those are builtins too 16:07:20 why do some have angle brackets, and others not? 16:07:30 what doesn't have angle brackets? 16:07:36 cons, car, cdr 16:07:38 ahh 16:07:40 whereas and do 16:07:41 well see 16:07:49 every function needs a "cond", which is 16:07:54 you can just have multiple helper lists 16:08:11 oh, angle brackets mean that that function's a good one to try as a condition 16:08:31 We need to invent branfuck 16:08:32 yep, and in fact it is what *will be* used as a condition 16:08:32 http://www.reddit.com/r/programming/comments/b5v3v/yo_just_print_like_hello_world_bro/c0l4545 16:08:39 that's something you could actually drop from the language 16:08:39 now I have to figure out how more-than-3 works 16:08:45 well "more than 3" 16:08:48 the guy who made the random interp just used there 16:08:52 for all functions 16:09:33 hmm, #0 and #1 refer to particular sorts of recursion? 16:09:40 nope, they are constants :) 16:09:47 heh, just like in INTERCAL 16:10:00 I've never seen something which has so much INTERCAL inspiration in the syntax and yet looks so different 16:10:07 :) 16:10:26 it's pretty different from everything, afaik. 16:10:38 still, if more than 3 is supposed to work on arbitrary integers, I don't have a clue how it works 16:10:46 if it's only meant to work on 0..5, it's obvious 16:10:47 oh well probably just on naturals 16:10:54 hmm, ok 16:11:04 oh well see 16:11:05 more than 3 ~ {. 4 -> 1 16:11:05 . 5 -> 1 } 16:11:11 this means 4 and 5 return 1 16:11:17 but they have to return 1 using the same rule 16:11:21 aha, "if it's 0, 1, 2, or 3, return 0, otherwise return 1" is the function you're trying to produce 16:11:33 now I get it 16:11:33 that means it will have to make that the "default branch" and make it return the constant 1 16:11:46 because you can only test for one value in each conditional 16:11:54 there can be one default branch 16:11:56 yeah 16:12:26 basically it combines parameters somehow, and puts the result in the function, result is used to differentiate between branches, the {...} things 16:13:06 if only one of them contains multiple values, then that'll be the default branch 16:13:34 i mean if there are multiple examples in some branch, they all have to return the same result with cond, except for the default branch 16:13:40 (if there's one) 16:14:01 hmm, I keep using the wrong mouse button 16:14:18 the left mouse button on this mouse has broken (it's ignoring about 2/3 of the clicks I use), so I swapped the buttons 16:14:42 in particular, I keep trying to use the right mouse button to right-click, although I'm getting good for using it to left-click 16:14:54 why not just ask a 4-dimensional dude to swap your left and right? 16:15:31 i c, i c 16:15:53 btw tell me if you touch clue, i actually like reading programs in it 16:16:05 probably the first language ever with that property ;) 16:17:02 i should probably add comments to the language... 16:17:28 i guess you could say "the following is a comment ~ ..." 16:17:42 no wait that won't work 16:17:43 theory: Google bought Youtube /just/ for leverage in getting rid of IE6 16:17:58 have to go for a bit -> 16:18:02 oklopol: use the comment as an identifier name 16:18:05 and give it a trivial definition 16:18:31 like this is a comment, isn't this program great? ~ { . 0 -> 0 } 16:18:38 but you'd need to repeat it again on the next line 16:18:57 maybe it should be possible to put nothing before a ~ in order to effectively get a repeat of the previous identifier 16:20:41 -!- jcp has joined. 16:25:37 AnMaster: That sounds as reasonable as anything, given that butterfly seems inherently a fixed-size operation. 16:26:15 mmm 16:26:57 well anyway www.vjn.fi/oklopol/clue.rar <-- downloaded 16:26:58 well actually the name of an identifier can contain arbitrarily many \n's 16:27:17 whitespaces are just stripped into " "'s 16:27:32 like "\n \t\n\n \n" -> " " 16:27:50 and yeah the repetition thing would be nice 16:28:12 the parser isn't very complete 16:28:58 the standards for parsers in the realm of esolang implementation are... pretty low, so i wouldn't worry about it. (I saw ALPACA's parser again the other day. Eeesh.) 16:29:21 cpressey, what about the one of ick? 16:29:39 it looked pretty okay considering the language it is supposed to parse iirc 16:29:54 the thing is this is so simple to parse you can do it as crappily as you want, and i wanted to watch scrubs while is coded, so... 16:30:02 there is that hack because you need infinite lookahead for some construct in intercal 16:30:04 *i coded 16:30:24 other than that it is just fairly complex lex and yacc iirc 16:30:46 scarf, right? 16:30:51 AnMaster: yep, the lex and yacc are tied into each other, although not quite as much as in gcc 16:31:08 scarf: so did you master the language already? :) 16:31:12 oklopol: not yet 16:31:22 I have work to do, even though I'm on a non-work connection 16:31:29 yarr 16:31:30 scarf, well... doesn't the yacc part depend on what output exactly the lex part produces in all cases? 16:31:42 AnMaster: yes, but also vice versa 16:31:44 -!- KingOfKarlsruhe has joined. 16:31:59 it's just what other people do is always more interesting than the things i do myself, when it comes to my languages 16:32:01 which is mentioned as being necessary sometimes in the lex/yacc documentation, but which seems silly to anyone who knows about parsers 16:32:10 scarf, well you could say that also exists, because if you change the lex part without changing the yacc part the whole thing might break 16:32:28 unless you meant in some other way? 16:33:04 AnMaster: I mean, the actual tokens produced depend on the current state of the parser 16:33:15 scarf, non-work connection? Public wlan? Finally have internet at home? 16:33:24 AnMaster: a friend's house 16:33:25 scarf, yeargh 16:33:36 I've been connecting from here for ages, just most people weren't paying attention 16:33:51 scarf, that means it is context dependant in some rather strange way doesn't it? 16:33:55 AnMaster: yes 16:34:00 scarf, you have a cloak though 16:34:02 how could I know? 16:34:10 to be precise, whether a paren-equivalent is opening or closing is context-dependant 16:34:17 and I was doing this from well before I was cloaked 16:34:38 -!- charlls has quit (Ping timeout: 245 seconds). 16:34:41 scarf, the reverse dns with something like bham in one part of it? 16:34:45 I thought that was uni 16:34:48 that one is uni 16:34:58 burning ham 16:34:59 the other one's virgin media 16:35:08 don't remember that one 16:35:24 brb 16:36:01 * scarf goes back to the Phorm website 16:36:12 I'm effectively polling it by hand to see if and when they decide to turn it on for virgin media 16:36:23 it'll be a distaster, but not one that people notice right away 16:36:27 *disaster 16:37:09 i need to add io to clue so i can make an irc bot 16:38:40 probably just something like >> after the output of a function to also output bytes or << after the input of a function to read bytes 16:39:35 Hello world! ~ {. 0 -> 0 >> [72, 101, 108, 108, 111, 44, 32, 119, 111, 114, 108, 100, 33] } 16:40:22 yep, makes sense 16:40:39 would you need to explicitly specify >> [] for other cases if you specify >> anywhere, or would that be assumed? 16:42:13 oh err 16:42:15 assumed 16:42:23 scarf, what is Phorm? 16:42:48 AnMaster: basically, it's a targeted advertising service 16:42:54 the controversial bit is the amazing way it operates 16:43:03 oh injection thingy 16:43:04 right 16:43:05 which basically involves multiple redirects for every single http request you make ever 16:43:26 and MITMing every website on the internet to inject cookies 16:43:32 scarf, that sounds like it shouldn't be legal for various reasons. 16:43:35 (it doesn't trigger on https, if you were wondering) 16:43:43 AnMaster: yep, some people think it isn't 16:43:44 Net neutrality comes to mind amongst other things 16:43:54 they haven't actually dared turn the thing on yet; there's meant to be an opt-out 16:44:11 scarf, so I assume it will be taken to court as soon as it is turned on 16:44:26 oh, someone will probably try 16:44:32 "try"? 16:44:38 okay, more interesting: echo n ~ {:. 5 <<[7] -> _ >>[7] : 4 -> _ } 16:45:00 AnMaster: they might not be able to get the funding 16:45:04 and of course, echo n ~ {. 0 -> _ } 16:45:25 what does the underscore mean again? 16:45:32 oh that's new 16:45:48 i just thought it might be nice to be able to say the return value doesn't matter 16:45:52 once you have IO 16:46:04 scarf, funding? How so? After all you don't need funding in case the police catch a thief that stole something from you. 16:46:04 heh, it's a RealWorld 16:46:14 AnMaster: hmm, you mean a criminal rather than civil case? 16:46:24 scarf, ah right forgot that difference 16:46:24 you'd need to persuade the Crown Prosecution Service to take it 16:46:38 scarf: actually it's just the empty list, except you don't have to put an explicit #[] in the helper list 16:46:46 ah, ok 16:49:03 hmm okay i have sort of a problem 16:49:22 if <<[5,6] is an example, "if you get bytes 5 and 6 as input, ..." 16:49:22 then 16:49:27 how many should it read? 16:50:04 always two bytes, always till eof, always two, unless there are other examples with different lengths, in which case till eof? 16:50:22 (two in the case of an example of length 2) 16:50:38 well in any case maybe IO isn't the first thing i should add 16:50:46 oklopol, is that for stdin? 16:50:53 although i would definitely like to see pong in this. 16:50:58 would be so outta character 16:51:03 AnMaster: IO 16:51:06 err 16:51:08 yeah << is input 16:51:14 -!- adam_d has joined. 16:51:37 oklopol, line buffered is probably sanest for an esolang 16:51:44 and then I guess whole line makes most sense 16:51:47 but... i hate line buffered :-( 16:52:08 oklopol, well then, I can't work out sane semantics for it 16:58:08 gotta go -> 17:01:32 something's up with Yahoo mail, it seems 17:01:50 I can't access the site at all in Firefox (I just get errors), and w3m goes into an infinite META REFRESH loop after logging in 17:02:19 as in, the page has a META REFRESH with a timeout of 0 on, and w3m is honouring it for some reason 17:04:32 Ugh. 17:05:27 seems to be a problem with the connection itself (tried a different computer on the same router) 17:05:28 -!- tombom has joined. 17:05:30 and the DNS is fine 17:06:00 hmm, working again now 17:06:02 that was suspicious 17:10:54 also, I just typed my root password in another channel by mistake 17:10:59 well, sudo-root 17:12:44 -!- Pthing has quit (Quit: Leaving). 17:13:40 scarf, so change the password now 17:13:46 I am, don't worry 17:14:03 actually, I changed it even before I typed it, somehow 17:14:12 as in, I typed the old password in-channel rather than the new one 17:15:16 heh 17:16:49 just one place left to change it; do you know how to change the master password for the KDE password wallet? 17:17:03 not that I care too much, because there's only one password /in/ that wallet and it's a publically-available one anyway 17:17:19 a publically-available password? 17:17:20 huh? 17:17:38 AnMaster: in this case, as an anti-spam measure 17:17:44 ah 17:17:52 the password and the place you have to enter it are in two completely separate places 17:18:04 scarf, what is it for? 17:18:14 guarding a file-upload server 17:18:20 ah 17:18:26 public one? 17:18:56 sort-of; public, but very specific purpose 17:19:02 oh? 17:19:11 it's for uploading Enigma levels 17:19:24 ah 17:20:39 hm? 17:20:57 I like that enigma game 17:21:48 miss piggeh 17:22:33 shut up hi augur 17:22:57 :( 17:23:12 whatd i do D: 17:23:23 interesting. SVG defines colours like "mediumspringgreen" 17:23:24 MissPiggy: when the next version comes out, you'll find many levels by me 17:23:31 scarf oh cool! what sort of levels? 17:23:45 (that one is rgb( 0, 250, 154) ) 17:23:45 mostly intelligence levels (as in, traditional puzzle-style) 17:23:48 I guess there's a turing machine in enigma now..... 17:23:51 but there are all sorts 17:23:51 http://www.w3.org/TR/SVG/types.html#ColorKeywords 17:23:55 quite a massive list 17:23:56 and no, I didn't add a turing machine 17:24:00 scarf well that's exciting! when does it come out? 17:24:07 MissPiggy: no release date yet, but they're getting closer 17:24:18 T_T 17:24:22 * augur runs away crying 17:24:26 they're in a string freeze for internationalisation at the moment 17:24:38 and if they're like a typical open source project, that's getting near a release 17:25:01 umm, it's a rather less strict sort of string freeze than typically, though 17:25:03 AnMaster: Darn, I missed that; I just read the bit about having to support the CSS names 17:25:24 Deewiant, well I don't know if it supports those embedded in css in the svg 17:25:30 Deewiant, or just in the svg directly 17:26:23 "The format of an RGB value in hexadecimal notation is a '#' immediately followed by either three or six hexadecimal characters. The three-digit RGB notation (#rgb) is converted into six-digit form (#rrggbb) by replicating digits, not by adding zeros. For example, #fb0 expands to #ffbb00. This ensures that white (#ffffff) can be specified with the short notation (#fff) and removes any dependencies on 17:26:23 the color depth of the display." 17:26:24 err 17:26:36 "removes any dependencies on the color depth of the display"? 17:26:36 Presumably in the SVG directly only 17:26:42 what does that mean exactly 17:26:42 -!- kar8nga has quit (Ping timeout: 256 seconds). 17:26:43 and how 17:27:28 I love the term "string freeze" for some reason. Sounds like it should be a kind of candy. 17:27:29 Deewiant, CSS3 seems to have these extra ones 17:27:36 but that is still a draft iirc 17:27:38 http://www.w3.org/TR/css3-color/ 17:27:44 and also it says draft there 17:28:15 Deewiant, so yeah you can't use those portably yet in CSS 17:28:33 -!- augur has quit (Ping timeout: 240 seconds). 17:29:31 * Sgeo has homework he needs to do NOW 17:29:36 Sgeo, go do it then 17:29:38 *shrug* 17:30:09 Deewiant, anyway most of those named colours would expand rather than save space 17:30:45 snow #fffafa 17:30:48 err sure... 17:31:10 snow varies widely and is in sunshine definitely extremely white 17:31:14 more white than that 17:31:38 also that was interesting 17:31:44 -!- Sgeo has quit (Quit: Homework time). 17:31:58 the text I actually selected and copied was: "snow #FFFAFA" 17:32:07 somehow it was lower cased when pasting 17:32:14 * AnMaster uses firebug on that thing 17:32:30 table.x11colortable td.c { 17:32:30 text-transform:uppercase; 17:32:30 } 17:32:31 heh 17:32:40 but why 17:32:46 and why wasn't it copied that way 17:37:25 -!- adam_d_ has joined. 17:37:26 Deewiant, ^ 17:37:51 What? 17:37:59 all of it 17:38:29 text-transform is just how to display it, of course it should copy the text itself 17:39:07 so a firefox bug there 17:39:27 -!- kar8nga has joined. 17:39:29 -!- kar8nga has quit (Client Quit). 17:40:14 on the other hand I don't know if the spec says it should not be processed when copied 17:40:24 No, it's not a bug. 17:40:29 It does exactly what I'd expect. 17:40:29 Deewiant, it isn't? 17:40:36 Deewiant, why does it make sense 17:40:36 And what I said it should. 17:40:41 to not copy the text transform 17:40:41 -!- adam_d has quit (Ping timeout: 256 seconds). 17:41:04 Because that's just a style note on how to display it 17:41:09 It's not the text 17:41:09 -!- KingOfKarlsruhe has quit (Remote host closed the connection). 17:41:20 hm 17:46:15 -!- kar8nga has joined. 17:46:18 -!- kar8nga has quit (Client Quit). 17:46:29 Deewiant, you know that mycology's TURT test is broken right? 17:46:36 17:46:36 17:46:36 17:46:54 as in, if it wasn't for svg you couldn't even be sure the circles were there 17:46:58 imagine it rendered to bmp 17:52:30 Hmm, I thought it was white background with two dots 17:52:41 Maybe it's the same bug in CCBI's colour stuff ;-) 17:52:48 Deewiant, well I don't think the error is on my side 17:52:49 But I seem to recall that !Befunge rendered it as such 17:53:03 Deewiant, I don't have !befunge around to test with 17:53:41 Deewiant, also I seem to recall that when I first implemented TURT in cfunge and found that the ccbi implementation was completely broken, it didn't ever use the bg colour 17:53:48 it does nowdays but still... 17:54:22 Sure it did 17:54:30 Deewiant, back then? No 17:54:34 I recall one bug being that it didn't "clear paper with colour", it just reset the bg colour 17:54:43 Deewiant, reset it to what? 17:54:49 To what was requested 17:54:50 hm 17:54:52 ah 17:54:55 It just didn't overwrite the dots and paths etc 17:55:48 Deewiant, I think efunge currently has the least buggy turtle implementation 17:55:56 at least that I know of 17:57:42 wow I can not read python at all 17:58:02 looking at clue impl. and I am just like HUH?? 17:58:50 MissPiggy, it is somewhat compact python 17:58:55 -!- augur has joined. 17:59:03 o hai 17:59:05 MissPiggy, and uncommonly it uses lambda 17:59:22 for python that isn't quite as common normally as it is in that file 17:59:32 same goes for map 17:59:59 MissPiggy, the key to reading it is realising that indention defines the block 18:00:22 hehe 18:00:29 I know that much python but that's all 18:00:30 MissPiggy, no {} or comma-vs-period or such 18:01:06 MissPiggy, also python's OOP seems used in there 18:01:10 the implementation lacks abstraction in maaaany places, because most of the thing was coded while watching scrubs 18:01:35 oklopol, scrubs? 18:01:45 -!- lament has quit (Ping timeout: 265 seconds). 18:01:46 oklopol is a bit scary 18:01:58 in terms of writing code that does miracles while not even looking 18:02:17 -!- lament has joined. 18:02:51 miss piggehhh 18:05:27 -!- kar8nga has joined. 18:05:30 -!- kar8nga has quit (Client Quit). 18:22:28 Deewiant, there? Would you consider it allowed for FPDP/FPSP instructions to reflect on NaN and +/-inf? 18:22:46 after all the spec doesn't define it to use IEEE semantics iirc 18:23:29 IIRC the spec says something like "A (a b -- n) add fp numbers" 18:23:44 Deewiant, yes but that doesn't define it to be IEEE floating point 18:23:52 Yes that was exactly my point 18:24:07 Like all of Mike's, there is practically no spec 18:24:10 Deewiant, also does FPDP require two cells per value? I don't remember 18:24:37 I'm not sure how Mycology will react to reflection on those though 18:26:01 Deewiant, and FPDP spec doesn't say it has to be two cells 18:26:57 Of course not, that's just an implementation detail for 32-bit funges 18:27:10 (Who assume "double precision" = "64-bit") 18:28:08 The fact that it uses the term "double precision" does sort of imply IEEE 754 semantics though, since double is an IEEE 754-1985 term 18:33:20 Deewiant: Alternatively, you could argue that it's supposed to use the platform's "standard" Fortran compiler's floating point formants, since "double" is also a FORTRAN term. 18:33:49 -!- augur has quit (Ping timeout: 276 seconds). 18:33:55 D'oh 18:35:07 It's a silly name; "double what?" (Double the size of single, of course, but *still*...) 18:35:39 "I'd like a double bacon cheeseburger, please, with double interpreted as from IEEE 754-1985" 18:35:45 -!- augur has joined. 18:36:04 They'll give you a burger with 64 discrete bits of bacon. 18:36:24 Of which one is the sign bacon. 18:39:02 !c printf("\u0082"); 18:39:14 Does not compile. 18:39:23 !c printf("\u00c0"); 18:39:26 À 18:39:30 !c printf("\u00c8"); 18:39:31 È 18:39:37 !c printf("\u00a8"); 18:39:38 ¨ 18:39:47 fizzie: IEEE 754-2008 calls it binary64, which is a bit less silly. 18:41:20 Deewiant: Yes, but on the other hand a "binary64 bacon cheeseburger" is more silly. 18:42:03 incidentally, why does unicodesnowmanforyou.com use javascript? 18:42:06 it seems to work just as well without 18:42:40 I think the scripts there are just google-analytics code. 18:48:01 I should encode it as tagged tuple BCD encoded 66 bit floating point (why? because 65 bits would make the single format 32.5 bits, which is quite hard to implement) 18:48:08 I doubt mycology would like that 18:48:38 AnMaster: why? 18:48:55 scarf, because it would be a DS9K implementation 18:48:57 doh 18:50:03 scarf, or did you mean "why wouldn't mycology like that"? 18:50:20 well, it would not have inf or NaN but would reflect on those to begin with 18:50:42 heck technically the spec would allow me to change to any delta for those 18:52:17 Just because the spec doesn't say you're not allowed to do something doesn't mean you should do it ;-P 18:53:21 Deewiant, true. Still if I implemented it in efunge it will be as opaque values on stack and reflect on nan/inf 18:53:42 I could do something like the "union with integer" trick, sure 18:53:47 but I don't think I should 18:54:02 it encourages bad programming practise in programs using FPSP/FPDP 18:54:04 Heh, funny motd from the shell server, when you interpret (like I did) the second part as a consequence of the first: 18:54:04 "Matlab Parallel Computing Toolbox has been installed for Matlab R2009b (latest version, run with 'matlab') and runs on any cluster machine or 64-bit Linux workstation. Scanning and sending documents from photocopier in corridor B works now." 18:54:08 like hard coding constants 18:54:12 ;_; 18:54:14 which is unreliable 18:54:20 and depend on endianness and various stuff 18:54:26 augur 18:54:46 fizzie, :D 18:55:51 fizzie: I write all my scanning software in matlab. 18:58:00 I can't imagine an object balancing a little as possible in four dimensions 18:58:13 like in 2d you have something halfway off a cliff 18:58:36 and in 3d you have something 1/2 off a corner in both directions 18:58:43 so it's on by only 1/4 18:59:04 imagine things balancing on a point 18:59:07 in 4d you have something 1/6 or 1/8 off an object 18:59:11 a line, a plane, a cube.... 18:59:20 yes 18:59:22 I've done that 18:59:39 Uh, if only 1/4 of the surface area of a book is supported by a table under it... well, that doesn't sound balanced to me... 18:59:43 I made this earlier for someone else: http://img693.imageshack.us/img693/5504/lkjsdkf.png 18:59:45 -!- Pthing has joined. 18:59:48 cpressey, it is 19:00:00 -!- adam_d_ has quit (Ping timeout: 265 seconds). 19:00:06 cpressey: If the table is round with a hole in the middle, and the book's edges are all supported by the ring of the table, then it 's perfectly balanced :P 19:00:29 gregor: I'm dealing with solid objects 19:00:43 Oh great, now tables with holes in them are gaseous. 19:00:56 I meant convex 19:00:57 :P 19:01:00 I should probably break from lunch before these unit tests drive me crazy. 19:01:03 But yeah, that puck would not stay on the table, 1/4 supported. 19:01:05 or for lunch, even 19:01:16 gregor: it would approach 1/4 19:01:27 Ahhh, 1/4 is the tipping point you're saying. 19:01:31 yes 19:01:39 or right behind it 19:02:25 but I can't imaging that king of interaction on 4D 19:02:28 imagine* 19:02:33 kind* 19:02:41 in* 19:02:53 Well, I just tried it with a pad of paper, and, yeah, I guess 1/4 is the approachable value for tipping. 19:03:03 great 19:03:53 I'm not sure if the approachable value in 4D is 1/6 or 1/8 19:05:04 I think 1/8 19:05:25 I would think so too 19:05:33 but then the interaction is happening on a 3D surface 19:07:30 it could either be 1/2^surfacedimensions or 1/(dimension-1)^dimension 19:07:36 er 19:07:50 *dimension 19:08:01 but I assume without testing that those are the same? 19:19:58 I think 1/8 too (1/2^d, where d is number of dimensions in contact surface). 19:21:02 Ah, I meant 1/d*2 - d being the contact surface's scope 19:21:54 rather than 1/(dm-2)^dm 19:34:59 -!- adam_d_ has joined. 19:40:09 -!- sshc has quit (Quit: leaving). 19:40:09 -!- sshc_ has quit (Quit: leaving). 19:40:16 -!- sshc has joined. 19:46:56 -!- FireFly has joined. 19:51:20 what are you talking about? 19:51:35 tipping point? 19:52:26 yes 19:52:43 oh picture was relevant 19:52:58 -!- BeholdMyGlory has joined. 19:53:45 so what does "approaches 1/4" mean 19:54:13 you can approach 1/4 before I woudln't know what happens between falling and staying on 19:54:18 wouldn't* 19:54:27 approach 1/4 in what sense? 19:54:34 what approaches 1/4? 19:54:34 contact 19:54:44 the contact area 19:54:45 surface area of the object? 19:54:51 that's in contact with the table 19:54:57 yes 19:55:09 the surface in contact must be 2D 19:55:18 It's because the centre of gravity of the object must go off the table if anything less than 1/4 of the surface area is supported 19:55:29 yes 19:55:43 we're assuming an object like a perfectly balanced disk 19:55:44 the surface in contact must be 2d? 19:55:46 what... 19:55:50 right, uniform density 19:56:00 cpressey: what if the object is, say, a really large disc, with a relatively small hole in the middle that's still larger than the table, with a thin beam across the middle that lies on the table? 19:56:11 that way, the centre of gravity is over the table even though most of the object isn't 19:56:42 and we assume the table is what shape? 19:56:42 scarf: That object is not uniform density, then, I think 19:56:45 why have a hold in the middle latger than the table? 19:56:50 cpressey: it is, but not convex 19:56:51 hole* 19:57:00 Wareya: ooh, good point, that isn't needed 19:57:07 you could just have a disc larger than the table 19:57:18 so I suspect that the missing assumption is that the table is infinitely large 19:57:26 Um, yes. 19:57:35 I'm assuming that the table is larger than the object, actually 19:57:36 Or at least that the object fits entirely on the table 19:57:39 I love that sort of assumption 19:57:46 yes 19:58:03 I'm thinking of a very specific kind of case; like the plate I have on the corner right here 19:58:21 is the edge of the table a (d-2)-dimensional line? 19:58:46 it doesn't matter as long as the table is flat and its coners are square 19:58:50 because then obviously 1/2 of the object must be supported 19:59:04 and I'm on the corner, not the edge 19:59:30 ohh. 19:59:33 now i get the picture 19:59:51 well let's see 20:00:00 scarf: I'm also assuming a 90 degree corner. 20:00:19 A 60 degree corner, well I'm not sure what fraction has to be supported, but it's less than 1/4. 20:00:22 okay it's obviously 1/8 in four dimensions 20:00:22 It could be worked out 20:01:22 the surface is a ball one eight of which must be inside the cube 20:01:32 eighththth 20:01:48 it's 1/8 or 1/6 20:02:01 can't really visualize 5 dimensions, but it clearly grows exponentially 20:02:02 1/8 20:02:03 OK, if it's a disc, and a 60 deg corner, then 1/6. I was still thinking "book" though. 20:02:10 Uh, if only 1/4 of the surface area of a book is supported by a table under it... well, that doesn't sound balanced to me... <-- you could have it balanced on a point in the middle. can't you? 20:02:13 so 20:02:14 I'm thinking of the 4D case, though 20:02:19 that means almost none of it is supported 20:02:24 and yet it is balanced 20:02:30 Wareya, right? 20:02:31 it's not none 20:02:31 in four dimensions, 1/8 20:02:33 it's a singularity 20:02:46 or... 20:02:49 yeah, actually 20:02:54 I'd call the 1/4 a singularity 20:03:14 or, infinitely before 1/4 20:03:23 I can't tell...? 20:03:29 Limit, maybe 20:03:40 you do realize this is just whether the center is on the surface? 20:03:52 oklopol: Yes, well I mentioned that anyway 20:04:08 the 1/(2^(d-1)) thing just comes from not just having the point, but a certain sort of cube around it 20:04:10 Wareya, am I not right about the balance in middle thing? 20:04:32 AnMaster: the other assumption: table is larger than object 20:04:58 rather, objects fits entirely on table 20:05:07 ah 20:05:22 http://img693.imageshack.us/img693/5504/lkjsdkf.png 20:05:30 cpressey, what if the object is heavier on one side 20:05:35 then it could stick out more 20:05:36 uniform density 20:05:40 oh that too 20:05:46 wasn't clearly stated at the beginning! 20:05:50 yeah cpressey, what if we make the problem even more boring 20:05:53 oh well* :D 20:05:59 ? 20:06:01 It's in your scrollback and/or the log, just not at the beginning 20:06:08 Wareya, also what if we don't have a equal height object 20:06:09 say 20:06:11 a cone 20:06:19 (that was to generalize what AnMaster said) 20:06:22 oklopol: the more interesting the problem, the more boring the result :) 20:06:23 it needs to have infinite rotational symmetry 20:06:23 then couldn't it stick out more than half 20:06:27 and it must be concave 20:06:27 a flat cone of course 20:06:32 er 20:06:33 convex 20:06:35 Wareya, and a flat top? 20:06:44 whatever :D 20:06:47 cpressey: i prefer "the more complicated the problem, ..." 20:06:49 -!- lament has quit (Ping timeout: 264 seconds). 20:07:02 Wareya, does it need a flat top or not? 20:07:06 and a flat bottom 20:07:10 oklopl, I take issues and I simplify parts of them to try to disprove things 20:07:17 it needs a 2D bottom 20:07:25 -!- lament has joined. 20:07:25 polgonal bottom 20:07:27 lsdkjasd 20:07:31 polygonal bottom 20:07:46 Wareya, so not a perfect circle? 20:07:52 as in, that picture 20:08:03 even if you need to ignore the "infinite number or sides" idea or a polygon 20:08:08 ah 20:08:16 and it doesn't need infinite rotational symmetry, it needs 90 degree rotational symmetry 20:08:27 Wareya, well this is boring. Too specific problem 20:08:37 okay 20:08:47 which agrees with oklopol's correction of cpressey's suggestion 20:08:54 Wareya, I don't know the 4D thing either 20:09:00 k 20:09:08 Wareya, but do a drawing in 5D for me :) 20:09:27 http://img651.imageshack.us/img651/3928/sagitor.png 20:09:47 what is that? 20:09:53 4d is pretty easy to visualize, because you just need to look at a 3d-segment 20:10:01 i mean the 4d case is 20:10:12 oklopol, yeah I have seen a 4D screensaver. Confusing! 20:10:14 then the collision is 3D 20:10:20 which I can't stand :( 20:10:28 stand -> deal with 20:11:19 Wareya, hm. isn't it basically that one specific point needs to be supported 20:11:30 not sure what the name of it is 20:11:34 the object must be smaller than the static one 20:11:40 AnMaster: "center of gravity" 20:11:44 cpressey, right 20:11:50 could only remember the Swedish word 20:11:52 AnMaster: it's not that hard to visualize the 3d projection of a 4d object, and the screensaver would project it even further 20:11:56 and the static one should be analogous to a rectangle 20:12:11 oklopol, was some hypercube turning iirc 20:12:16 oklopl: I can deal with 4D, but not collision inside of it. 20:12:23 but you can also "visualize" 4d using color and density etc 20:12:30 yes 20:12:34 AnMaster: how's that confusing 20:12:40 Wareya, anyway yes I think it basically needs center of gravity to be supported 20:12:49 oklopol, not everyone finds 4D easy to think in! 20:12:54 that's not what I'm wondering, though. 20:12:54 oklopol, not everyone is like you 20:12:56 okay? 20:13:06 Wareya, well then what exactly are you asking? 20:13:22 I described it enough 20:13:23 -!- gm|lap has joined. 20:13:25 well i mean it's just a 2d projection of the movement 20:13:32 Wareya, how much of the thing needs to be supported 20:13:45 Wareya, well "whatever is enough to cover the center of gravity" is my answer 20:14:00 It should be fairly easy to generalize the concept of center of gravity of a uniform-density, symmetrical object, to /n/ dimensions. 20:14:11 cpressey, yes quite 20:14:14 It mean, it's the geometric center. 20:14:58 now the question is, do we need a vector space, or could we also do it for measurable metric spaces? 20:15:23 Mmmmmmmmmaybe. 20:16:01 a point is central if it's close to all the other points, and we can measure the sets of points at distance > d, so we can make this precise 20:16:05 Since we apparently don't find 4D difficult to visualize :) 20:16:13 difficult *enough*, I mean 20:16:53 yeah 4d is for kids 20:17:35 oklopol, so do it in 93d 20:17:42 do what? 20:17:54 oklopol, anything at all 20:18:02 Wareya, btw what do you need this for? 20:18:54 so let's see, in n dimensions, we'd take the z0 such that the integral of (z - z0)^(smth) over the object is as small as possible? 20:19:02 that's at least some sort of center 20:19:26 it was just an idea 20:19:36 I was wondering what the fraction would be for the fourth dimension 20:19:40 whether it were 1/6 or 1/8 20:20:11 in the specific case of a shape with a convex, 2d base and 90 degree rotational symmetry along its vertical access 20:20:16 Wareya, now figure it out for 1d (I'm not even sure what it would mean there) 20:20:24 1d is 1 20:20:51 you can't have an object rotate in 1 dimension 20:20:59 indeed 20:21:15 1/1, 1/2, 1/4, 1/8 20:21:22 so it would make sense that it's 1/8 20:21:43 the sequence is 1/2^n as mentioned 20:23:26 the surface touching the table is (d-1)-dimensional, consider the unit ball in d-1 dimensions, the table surface will be {(x1,...,xn) | xi > 0 for all i}, that is, the infinite cube spanned by the positive axes. 20:23:39 so we have d-1 axes, and we take half of each 20:23:50 => 1/2^(d-1) 20:24:22 it would be easier to use the analog of a cyninder to the dimension 20:24:29 what? 20:24:32 than the analog of a sphere 20:24:34 oklopol, unit ball as in unit circle? 20:24:38 http://img693.imageshack.us/img693/5504/lkjsdkf.png 20:24:42 shouldn't that be unit sphere? 20:24:44 the disc is uniform, so we just need to consider the surface touching the table 20:24:47 or maybe not 20:24:49 which is a ball 20:24:58 if you use a sphere, the surface would be a singularity 20:25:01 and... you know 20:25:32 Wareya: it's a balance tipping point, you're dealing with a limit anyway. 20:25:43 yes 20:25:49 and if you deal with a limit and a singularity ,then what? 20:25:57 no, it's not a unit sphere. consider the concrete dimensions: in 2d we have a line as the unit ball of d-1 dimensions, in 3d, we have a 2d disc, in 4d, we have a normal 3d ball 20:25:59 etc 20:26:14 that works 20:26:34 "singularity" is just another way to say "limit", isn't it? 20:26:39 no 20:26:49 a singularity uses a limit to describe itself 20:26:57 Where is the "singularity" in this sphere, then? 20:27:05 Wareya: there's no "analog of sphere" or "analog of cylinder", by a d-1 dimensional ball i mean the natural embedding of a d-1 dimensional ball into a d dimensional space 20:27:22 the contact area of a 3D sphere against a 3D rectangular prism can only be a singularity 20:27:26 so in 3d, you'd have a disc, in 2d, you'd have an etc 20:27:26 unless they intersect 20:27:40 oklopol, okay 20:27:45 so, what the fuck is a singularity? 20:27:51 size n 20:27:55 lim(n->0) 20:28:17 Wareya: so the contact area is lim(n->0), which sounds like a limit to me 20:28:18 on reals that limit is 0 20:28:27 the "singularity" of a computer screen is a pixel 20:28:49 of the scope of a* 20:28:49 sounds like some sort of intuitive nonstandard analysis 20:28:59 aka bullshit 20:29:04 :) 20:29:09 :D 20:29:34 http://en.wikipedia.org/wiki/Mathematical_singularity 20:30:27 Nothing discontinuous in the sphere/table setup, though. 20:30:44 why do you need a "singularity", can't you just say the object's center is exactly at the tip of the corner 20:30:46 if you have two colliding singularities, what do you do? 20:30:58 treat them as spheres, boxes? 20:31:27 Wareya: these singularities are not actually well-defined mathematical objects 20:31:39 well the ones the article talks about are 20:31:48 neither is an infinitely small point 20:31:58 which the surface of intersection with a sphere is 20:32:08 2infinitely small point"? 20:32:11 *" 20:32:18 yes 20:32:27 in any sensible measure of volume, a set containing just one point has measure 0 20:32:31 that's my use of the word in this case 20:32:35 so all points are infinitely small 20:32:51 Yet some points are infinitely smaller than others! 20:32:58 so why not just put the disc on the corner 20:33:10 that's what I was using to begin with 20:33:44 oklopol what's bullshit about that 20:35:03 MissPiggy, I prefer the term "science fiction". Whereever there is a singularity, there is a paradox caused by execessive quantum flux. 20:35:27 because people who talk about singularities in that sort of context don't have any idea what they're talking about 20:35:43 I have a proof for this, but my wormhole ate it. 20:35:53 oklopol, it's another way of using the word. 20:37:13 i mean what the fuck does "lim n-->0" mean, the point that n approaches as n approaches 0? 20:37:20 that sounds sensible 20:37:27 cpressey hehe 20:37:36 n is its size 20:37:46 the size of the OBJECT that we are calling a singularity 20:38:04 mesh size? 20:38:09 so do we have some sort of measure on these objects? 20:38:13 nonstandard analysis is just as much bullshit as ZFC 20:38:15 what's the size of 1? is it 1? 20:38:25 MissPiggy: there's nothing bullshitty about nonstandard analysis 20:38:33 (since there is an algorithm to translate proofs back) 20:38:35 there's a lot of bullshit about people doing it without knowing what it is 20:38:39 oklopol, what is the unit of "1"? 20:38:43 souds like all caluculus oklopol 20:38:52 people doing it all without knowing what it means 20:38:55 mostly 20:39:01 yeah, that's bullshit too 20:39:13 I have a proof for this, but my wormhole ate it. <-- no no "but the singularity is too small to contain it! 20:39:15 " 20:39:18 well sure, they're memorizing useful algorithms 20:39:27 but i mean for a mathematician 20:39:33 AnMaster: ok, that's actually a good joke 20:39:39 AnMaster: Um... it was a very small proof? 20:39:58 cpressey, -_- 20:40:03 Fermat joke 20:40:18 Lost on me, sorry. 20:40:24 OH 20:40:27 no it isn't 20:40:34 i mean you have to know the story 20:40:35 Hah. 20:40:51 I liked both cpressey's original, and AnMaster's correction 20:40:58 the correction wouldn't have been funny without the original joke 20:41:44 lol 20:41:55 scarf, you could have used the corrected one in place of the original 20:41:58 Wareya: i assumed we were talking about a vector space, if the size of a vector is its length, then obviously the only vector whose length is smaller than any positive number is the zero vector. 20:42:12 obviously = by definition 20:42:18 the original was funny too, though, and doing them in the other order wouldn't have worked 20:42:19 it's not vector space 20:42:28 scarf, true 20:42:29 then what is it? 20:42:31 it's real space - the one we don't know how to define 20:42:35 scarf, but just doing one would have worked 20:42:37 oh 20:42:42 that's discreete afaik 20:42:44 *discrete 20:42:47 okay 20:42:47 AnMaster: yes, but it wouldn't have been as funny cumulatively 20:42:50 by the way 20:42:51 two jokes are better than one 20:42:52 and who cares 20:42:54 wormholes 20:43:01 how does that interact with gravity 20:43:02 I mean 20:43:14 AnMaster: The higssdafjkshdfjklsdh boson did it 20:43:23 imagine you have a wormhole from somewhere near earth surface to somewhere on the moon 20:43:30 -!- Gracenotes has quit (Ping timeout: 245 seconds). 20:43:32 would that give earth gravity at the moon? 20:43:37 or what the heck would happen 20:44:20 AnMaster: since physics seems to happily accept the idea that gravity means curved space, ... 20:44:22 gravity is a field effect 20:44:38 is it a distortion of an object's inertia 20:44:45 cpressey, yes. But what would happen here 20:44:57 AnMaster: well, a wormhole is curved space, too, right? 20:45:07 Therefore wormholes are a kind of gravity. 20:45:11 hm 20:45:20 cpressey, holes that changes the topology too iirc 20:45:42 So they're gravity++ 20:46:00 heh 20:46:08 cpressey, so everyone would get crushed in wormholes? 20:47:03 It seems "reasonable" that it would be much easier to "fall" into one than to get out, anyway. 20:47:45 I mean, if it goes straight from Earth to Earth's moon, that's one hell of a curve. 20:47:47 Yet things get out. 20:47:57 so they? I have yet to see one 20:48:02 s/so/do/ 20:48:52 "Under the theory of quantum mechanics black holes possess a temperature and emit Hawking radiation. 20:48:56 " 20:48:59 http://en.wikipedia.org/wiki/Black_hole 20:49:01 lol 20:49:03 oh that yes 20:49:17 but a wormhole wouldn't have a event horizon iirc 20:49:39 a black hole contains a wormhole 20:49:42 from what I've read 20:50:18 hm 20:53:35 -!- oklopol has quit (Ping timeout: 265 seconds). 20:54:57 -!- charlls has joined. 21:01:36 I don't believe in black holes. 21:01:51 -!- augur has quit (Read error: Connection reset by peer). 21:02:50 -!- augur has joined. 21:07:25 -!- augur has quit (Ping timeout: 264 seconds). 21:12:13 Do you believe in the power of voodoo? 21:12:59 -!- augur has joined. 21:14:08 "Any undocumented functions in [the module] string should not be used." <-- okay, why do they need to point that out? 21:18:39 I wonder if they've documented the undocumented functions yaws uses, yet 21:22:50 Undocumented voodoo black holes. 21:27:22 That's where the flying nose demons live. 21:29:55 cpressey, what are those functions yaws uses? 21:30:05 I assume you mean the erlang yaws 21:33:18 Yes. It uses some Erlang-internal mechanism to parse HTTP headers, iirc. 21:34:51 cpressey, oh? 21:39:33 -!- oerjan has joined. 21:40:20 AnMaster: ... yes. 21:40:48 hm 21:43:16 absolutely not! 21:43:26 * oerjan now goes to find out what he was denying 21:45:48 night → 21:46:15 oerjan: that erlang has an undocumented function to parse HTTP headers 21:46:32 ah. 21:46:56 well that would _clearly_ be nonsense, since i read here the other day that ericsson document _everything_ 21:48:15 They even document the fact that you're not supposed to use undocumented functions. 21:48:20 theory: Google bought Youtube /just/ for leverage in getting rid of IE6 21:48:49 isn't the IE6 problem mostly about all the business sites using them, and wouldn't they like to _block_ youtube anyways 21:48:51 * scarf waits for oerjan's opinion, and/or a terrible pun 21:48:55 *it 21:48:59 oerjan: hmm, yes 21:51:05 08:29:21 cpressey, what about the one of ick? 21:51:06 08:29:39 it looked pretty okay considering the language it is supposed to parse iirc 21:51:17 isn't ick's parsing sort of hyper-advanced 21:51:42 parsing INTERCAL is hard 21:51:46 (going by vaguely absorbed discussions here) 21:52:01 CLC-INTERCAL's parsing is crazier, I think it's fully nondeterministic or something like that 21:52:18 oerjan: Nowadays, yes. *However*, ending IE6 support on Youtube might finally get it into the beancounters' bean-sized brains that IE6 is ancient. 21:55:39 -!- FireFly has quit (Quit: Leaving). 21:55:47 -!- kar8nga has joined. 21:55:50 -!- kar8nga has quit (Client Quit). 21:56:49 -!- oklopol has joined. 21:57:15 ah oklopol 21:57:23 an oklopol 21:57:56 beware of the okloclones 22:05:53 on oklopol 22:09:59 ol' oklopol 22:11:22 -!- BeholdMyGlory has quit (Remote host closed the connection). 22:16:00 12:49:39 a black hole contains a wormhole 22:16:30 i've read that it contains a singularity 22:17:30 and that wormholes are very hard to stabilize, and tend to pinch off into singularities 22:21:28 wormholes cannot be stable because they need either exotic matter or dark energy 22:22:11 yeah 22:24:56 im a asrophisicist let me answer yourn question 22:25:19 theyre very stable 22:26:24 i may not be an astrophysicist, but i've read enough to suspect you're trolling 22:26:41 OTOH, creating or destroying wormhole between two points in same space would involve topology change... 22:26:52 HOW ON EArth did you guess that 22:27:26 tombom: because you are directly contradicting the wikipedia articles i browsed minutes ago? 22:27:55 yeah that was sarcasm as well, i thouight my terrible spelling might have been a clue 22:28:05 i don't know, maybe scientists are renowned for terrible spelling 22:28:19 tombom: i was _trying_ to ignore that, i didn't remember whether you were a dyslexic 22:28:40 And energies related to topology changes might be very high. Magnetic monopole is thought to be particle related to spacetime topology and have mass somewhere on order of 10^16 GeV/c^2... 22:28:44 you're an incredibly generous person 22:29:08 why thank you 22:38:56 -!- tombom has quit (Quit: Leaving). 22:40:04 -!- augur has quit (Ping timeout: 256 seconds). 22:49:14 -!- oklopol has quit (Ping timeout: 246 seconds). 22:51:56 -!- charlls has quit (*.net *.split). 22:51:56 -!- adam_d_ has quit (*.net *.split). 22:51:56 -!- Pthing has quit (*.net *.split). 22:51:56 -!- scarf has quit (*.net *.split). 22:53:46 -!- charlls has joined. 22:53:46 -!- adam_d_ has joined. 22:53:46 -!- Pthing has joined. 22:53:46 -!- scarf has joined. 23:01:15 -!- adam_d_ has quit (Quit: Leaving). 23:03:23 -!- madbr has joined. 23:23:05 -!- augur has joined. 23:24:33 -!- sshc has quit (Ping timeout: 276 seconds). 23:28:54 -!- songhead95 has joined. 23:31:55 -!- songhead95 has left (?). 23:33:16 -!- songhead95 has joined. 23:34:19 -!- songhead95 has left (?). 23:34:32 -!- songhead95 has joined. 23:34:48 -!- sshc has joined. 23:35:38 -!- coppro has joined. 23:35:42 -!- sshc has quit (Client Quit). 23:35:49 -!- sshc has joined. 23:37:12 Hello 23:39:11 hi 23:39:38 Is anyone ever on the brainfuck chan anymore? 23:40:15 probably not 23:40:25 this one's used for all esolang discussion nowadays, it seems 23:40:33 Great language. 23:41:38 When I made a language, I had to make it cell based 23:41:55 So It would be brainfucky 23:49:43 -!- cpressey has left (?). 23:52:22 -!- songhead95 has quit (Quit: songhead95). 23:53:00 -!- son_ has joined. 23:56:27 -!- son_ has quit (Client Quit). 23:57:20 -!- son_ has joined. 23:59:05 -!- kwertii has joined. 23:59:57 -!- son_ has left (?).