00:06:13 Nobody on #sqlite channel knows how to answer my question how to fix it so that, it is possible to use savepoint inside of a INSTEAD OF trigger program and to rename views and other stuff. 00:06:25 -!- MoALTz_ has joined. 00:07:59 -!- tromp has joined. 00:08:57 -!- MoALTz has quit (Ping timeout: 252 seconds). 00:21:22 I am typing in session 51 of Dungeons&Dragons game, for now. 00:22:46 In the D&D game I am playing the entire party of 5 people is completely split 00:23:04 That is certainly possible, and sometimes very useful. 00:23:04 Two of us, including my character, have been arrested 00:23:11 For what? 00:23:32 Possession of some sort of superweapon 00:23:52 And antagonizing an empire 00:24:37 My character once did get arrested...on purpose. 00:26:03 This was very much not on purpose 00:26:21 (I knew I would be let out in time, and there were other reasons and things too, including the phase of the moon.) 00:26:33 It was quite surprising that 3 of the party managed to get away 00:26:41 When playing at D&D, you have to take advantage of the phase of the moon. 00:27:03 One by pretending to be blind and so harmless (his character is actually blind but it isn't a hindrance) 00:27:28 One by using a carpet as a moving wall to shelter himself from arrows 00:28:07 And one by teleporting through a very small hole in the ceiling onto the roof 00:31:03 zzo38, any advice for getting out of jail in D&D? 00:31:07 I have once managed to escape by replacing a door with its mirror image, stealing a wizard's wand, secretly giving it back to him, and stuff... 00:31:21 Taneb: I cannot say, since it depends a lot on the exact circumstances. 00:31:46 I'll have to figure it out myself 00:32:12 I don't think the rest of the party will rescue me (it would be out of character for them) 00:32:15 You may just have to wait; even if you can do other things, sometimes that is the best way anyways. 00:33:07 I've got the impression that if I wait I will eventually be executed or at least skinned alive 00:33:17 Neither of which are ideal 00:33:22 Then don't wait too much! 00:33:35 I think my best bet will be to talk my way out 00:33:37 Do you have the way to write letters? 00:33:46 The pen is mightier than a sword, so use a pen! 00:33:57 :D 00:34:03 That may be the best option 00:34:10 My character does have quite high charisma 00:34:32 (That's what I did; not to get out of jail though, but to convince someone to do something while I was in jail.) 00:36:56 High charisma is not enough. You also need a paper to write on! 00:37:27 Yeah, that may be an issue 00:37:39 I will also need some form of writing implement 00:38:26 At one point, I wanted to tell something to someone in a house which I did not want to go near, and I had no pen or paper, but I did have a book, so I searched the book for a phrase similar enough to what I wanted to say, tore it out, tied it to a rock, and threw it through the window. 00:38:52 Of course, if nothing else works, try using magic if you have any. 00:42:57 static int bogo_comp( const void *a, const void *b ) { return rand() % 3 - 1; } 00:43:00 qsort( deck, n_cards, sizeof(int), bogo_comp ); 00:43:08 cute 00:44:38 nooodl: Is that like "ORDER BY RANDOM()" in a SQL program? 00:45:13 it might be! depending on the sort ORDER BY performs 00:45:27 i don't think this is a veeery good shuffle though 00:47:50 I think ORDER BY will perform the same sort as if the value specified is an extra column of the table, then sort by that fake extra column. 00:51:11 -!- idris-bot has joined. 00:53:03 oerjan: answered 00:59:19 -!- Phantom_Hoover has joined. 01:00:17 -!- nooodl_ has joined. 01:03:54 -!- nooodl has quit (Ping timeout: 240 seconds). 01:19:52 -!- Phantom_Hoover has quit (Remote host closed the connection). 01:34:29 Grr why doesn't Pharo come with Symbol>>asBlock? 01:34:46 -!- MoALTz__ has joined. 01:37:08 -!- MoALTz_ has quit (Ping timeout: 240 seconds). 01:39:22 thats a ruby hack 01:41:03 -!- Bike has joined. 01:53:19 is it UB to give qsort a comparison function that isn't a total order 01:54:34 shouldn't it only have to be partial? 01:54:35 rust has separate Eq and TotalEq, Ord and TotalOrd 01:54:41 and much controversy over where floats fit into this 01:54:44 is there PreOrd 01:54:46 no 01:54:55 well what's the fucking point them 01:54:57 then 01:55:02 i need a whole hierarchy of ordinals! 01:56:38 Probably no less defined than rand is 01:57:05 hm, do normal sorting algorithms work with partial orders? 01:57:18 "work" 01:57:36 Most of them will do something and then terminate 01:57:43 wow 01:57:54 such turing machine, very halting 01:58:03 informative helpful answer a++ 01:58:22 kmc: Actually, there is case where I would find such a thing helpful, to use sorting with partial ordering. 01:59:40 What's PreOrd? 02:00:44 are partial orders the same thing as transitive DAGs? 02:01:12 Partial orders are same thing as a thin category. 02:01:57 Sgeo: a preorder. 02:03:42 Is there a thing such as logic without free variables? 02:03:55 I believe I can figure out how to do it. 02:05:15 combinatory? 02:08:05 What do you mean by that? 02:11:36 * Sgeo wonders how PetitParser compares to Parsec 02:12:03 I vaguely recall something saying that PetitParser includes parser combinators, but also has something that avoids some pitfall? 02:12:22 "Instead it uses a unique combination of four alternative parser methodologies: scannerless parsers, parser combinators, parsing expression grammars and packrat parsers." 02:13:26 I know about recursive descent parsers 02:13:30 I don't know what is packrat parsers 02:14:39 Wikipedia article about "packrat parser" redirected to "parsing expression grammar". 02:16:16 fungot parser 02:16:16 kmc: bzip2 is slow, of course. 02:16:21 fungot: of course. 02:16:22 kmc: the cable doesn't bother me. lisp is shorter. people usually call " porting" gambit's web server? :) i'm implementing the cursors inside these structures partially with the postgresql c library. however, major dissidence isn't usually likely to be overtly malicious than to ddos :) 02:16:31 ^style 02:16:32 Available: agora alice c64 ct darwin discworld enron europarl ff7 fisher fungot homestuck ic irc* iwcs jargon lovecraft nethack oots pa qwantz sms speeches ss wp youtube 02:18:48 -!- canaima_ has joined. 02:19:28 -!- tromp has quit (Remote host closed the connection). 02:20:04 -!- tromp has joined. 02:20:16 -!- canaima_ has quit (Client Quit). 02:24:02 zzo38: i mean that the idea behind combinatory logic was "hey can we do lambda calculus w/o variables" 02:24:38 -!- tromp has quit (Ping timeout: 265 seconds). 02:24:47 Bike: Yes, I can see that, but it isn't what I meant. 02:25:31 I mean that you still have variables, but only quantified variables. 02:27:32 isn't that the norm 02:27:46 The Wikipedia article about sequent calculus mentions the restrictions on the use of free and quantified variables; this can be avoided by not having any free variables. 02:29:39 The "forall R" and "exist L" rules would be changed, by instead of a free variable "y" made up above the line, it would make up a unique "free atom", which is one not allow to use anywhere else; each usage of the rule makes up a new one and it isn't an atom mentioned elsewhere in the sequent above the line. 03:05:43 -!- ^v has joined. 03:19:56 -!- nooodl_ has quit (Ping timeout: 240 seconds). 03:22:49 -!- shikhin has joined. 03:27:17 -!- tromp has joined. 03:38:51 -!- Sorella has quit (Quit: It is tiem!). 03:44:08 A lot of people don't believe me that in SQL, savepoints would be much more useful if allowed inside of a trigger program. 03:46:04 Fuck continuation-based web development 03:46:32 Sgeo: What? 03:46:59 This site is practically unusable: http://bugs.pharo.org/ 03:47:28 Try navigating to a bug, then figuring out how to share a link with a friend 03:49:00 That is terrible 03:49:14 http://bugs.pharo.org/issues/register/id/2058?_k=t5FQ1yAmItNRJSof let's see 03:49:55 Bike: open that in an incognito window 03:50:02 http://bugs.pharo.org/issues/register/id/7627?_k=LAzNiBTJSnR_WP0l 03:50:08 oo werid 03:51:59 That is not the point of URLs and if you do not want URL of each file, don't use a webpage at all and just make a telnet or whatever. 03:58:35 How do you mess up a bug tracker that badly? 03:59:28 `addquote That is not the point of URLs and if you do not want URL of each file, don't use a webpage at all and just make a telnet or whatever. 03:59:29 1194) That is not the point of URLs and if you do not want URL of each file, don't use a webpage at all and just make a telnet or whatever. 04:00:26 pikhq: it's an anonymous frontend to a login-required bug tracker 04:04:58 Sgeo: What is the point of that? 04:05:20 Of the horrible URLs, or of the site? 04:05:28 It's good to not need to login to view bugs 04:05:29 Of an anonymous frontend to a login-required bug tracker. 04:05:52 In the way that that one is done. 04:07:04 Pretty sure the use case is independent from the poor implementation choice 04:07:06 I blame Seaside 04:07:51 I think continuations have their uses in web development, but... not for this. Maybe during checking something out from an ecommerce site, or a password reset flow (although with the latter, need to be sure some idiot doesn't send the URL to a friend) 04:07:57 (well, with both) 04:08:24 I think such thing is just all wrong. 04:09:54 I assume this is not as terrible even though it's similar in development style 04:09:55 http://www.impredicative.com/ur/demo/counter.html 04:09:59 The URLs are much cleaner somehow 04:10:04 But also easy to tamper with 04:10:08 Don't use webpages if you don't want their kind of state transactions; use them for non-interactive sessions instead. Interactive stuff can be including IRC, telnet, SSH, etc (and even block-oriented terminals, if necessary) 04:10:37 http://www.impredicative.com/ur/demo/Demo/Counter/main 04:11:12 You can use an entirely stateless stuff if you need to, as well, which saves a lot of problem, too. 04:11:24 You don't need any cookie either, then. 04:11:31 zzo38: sadly, users expect websites 04:11:49 You can make websites with stateless stuff too though 04:12:34 Resetting a password seems tricky to do without some sort of state, unless you like messing with encryption 04:13:03 hmm, bad example, I'm only really familiar with one example of a reset password flow 04:13:09 As far as I could see password reset usually used email though? 04:13:37 zzo38: a reset password flow where first you answer questions or whatever before being allowed to send the email 04:13:42 hypothetically 04:14:08 Sgeo: That isn't a problem either; you have HTML forms for that! 04:14:38 How about logging into a website? 04:14:55 There is HTTP authentication. 04:15:06 -!- Froox has joined. 04:15:06 -!- Frooxius has quit (Read error: Connection reset by peer). 04:15:33 (Of course it isn't as secure as SSH, even if HTTPS is used) 04:21:46 And when you don't require these kind of things, you need no HTML, HTTP, SSH, SMTP, or whatever else; the gopher protocol is really simple and all stateless; there is no cookie or anything like that. Also, you don't have to make a separate "mobile version", or make other considerations about the user interface and so on; 04:22:18 ide/theory: avoid having state by avoiding passwords by avoiding having information to secure 04:22:45 it works just as well with a keyboard, mouse, touch-screen, various sizes, hardcopy terminal, fax, punched cards, postal mail, or whatever else; without having to change anything. 04:23:00 wouldn't gopher be slower with postal mail 04:23:40 shachaf: Yes it would certainly be slower with postal mail, but that isn't the point at all. 04:24:11 Bike: Yes, in cases where you don't need a password, where you can do without a password and that stuff, it can. 04:25:00 addendum: never need a password 04:26:39 When you do need a secure system, there are several ways. For example, require login over SSH. Or, you can encrypt the files and download it, and whoever has the password can use a decryption software to access it. 04:26:55 whoa whoa whoa, didn't i just explain. don't need a secure system 04:27:23 If you don't need a secure system, then that is easy: ignore all of that stuff, and make more simplicity. 04:27:46 -!- augur has joined. 04:31:11 also fun security fact, my job's secure login works over https, but also has an http address. it asks for credentials and takes them but then presents nothing if you use it 04:31:14 v. secure 04:32:52 it's really negligent to run a plaintext HTTP server that serves anything other than a redirect with an HSTS header 04:32:55 to HTTPS 04:33:15 i assume letting me enter my password over http is also bad 04:33:31 yes 04:33:50 thankfully, i'm the type of person who'd give up their password for a chocolate bar, so there's no net lowering of security in my using this system 04:34:17 if you serve any part of your domain at all over plain HTTP -- even the boringest static terms of service page -- then an active attacker has arbitrary code execution for that whole subdomain and can substantially mess with the entire domain 04:34:33 i'd ask them to fix it, but it took like three days with IT to get on in the first place so i'm not gonna bother 04:34:35 a lot of web developers don't know this 04:34:44 arbitrary, huh. 04:34:55 yep, they can inject arbitrary javascript 04:35:17 which has permission to read cookies for that domain, mess with same-origin windows, make same-origin requests etc 04:35:23 That is also a problem with HTTP and HTML in general. Even if you do use entirely HTTPS! 04:35:29 kmc: can't read every cookie 04:35:34 that's right Sgeo 04:35:40 Use SSH for secure login interactive sessions, and work much better. 04:35:45 HttpOnly cookies are a weak protection though 04:35:56 you can still make requests that will include that cookie 04:36:09 i imagine Sgeo meant Secure cookies 04:36:10 it doesn't really matter because if you can inject JS then you can also sniff the cookie off the wire 04:36:18 nice, the instructions have how to do it on XP 04:36:37 "Because we use a newer file storage system at the College of Veterinary Medicine, older Mac operating systems cannot access Vetmed files. You will need Mac OS 10.6 (Snow Leopard) or software that allows for Mac-Windows interoperability, such as Thursby Software's Dave" 04:36:39 in some cases you can overflow the cookie jar and replace the cookie with a non-Secure cookie on a broader domain 04:36:54 kmc: as shachaf notes, can't read Secure HttpOnly cookies over the wire... but yeah, arbitrary requests to the real site 04:37:15 anyway, even just not serving anything over http isn't sufficient without something like hsts 04:37:34 right 04:38:42 unfortunately, as you probably already know, computer security 04:38:46 You can still serve plain files over HTTP, and forms and stuff which are simple enough, but there are generally better ways in any case already. 04:38:57 like gopher 04:39:38 computer SCOWrity 04:39:42 gophers 04:40:21 Remember that there are other protocols, and HTTP can be used to fall-back-on, perhaps. 04:40:38 (There are also better ways of using HTTP than all those terrible ways, too, though.) 04:42:06 the trouble with fallbacks and security is that they have to be as secure as the not fallbackthings 04:42:24 Post a warning message. 04:42:32 it's fun going back and forth from homomorphic encryption or whatever to My Daily Life 04:42:33 Disable some features if needed. 04:43:33 Write a warning message on the webpage that says that it is "deprecated" and insecure, and that you are offered to better alternatives if possible. 04:44:01 that only helps if the user sees the web page 04:44:23 That is true, of course. 04:44:49 `quote zzo38.*reasonable 04:44:50 113) Some people are reasonable, some people who are not reasonable insist on changing things so therefore progress depends on not reasonablepeple 04:44:56 But otherwise, if it consists of nothing then the problem corrects itself (giving you another problem, if you didn't already fix that one). 04:59:07 `danddreclist 51 04:59:08 danddreclist 51: shachaf nooodl boily \ http://zzo38computer.org/dnd/recording/level20.tex 05:02:00 There it is! 05:03:12 Do you like this latest Dungeons&Dragons game by now? 05:03:34 you'll never shine if you don't glow 05:04:00 Yes 05:04:14 But I don't glow either. 05:05:22 oh 05:13:12 [wiki] [[Stacked Brainfuck]] http://esolangs.org/w/index.php?diff=39483&oldid=32424 * Killer64 * (+0) USing -> Using 05:32:10 -!- ^v has quit (Read error: Connection reset by peer). 05:32:23 -!- ^v has joined. 05:36:11 -!- tertu has quit (Ping timeout: 276 seconds). 05:37:12 someone familiar with category theory please confirm/deny: if F is a functor, the statement "F is injective on objects" is not preserved by natural isomorphism 05:38:54 sounds right to me 05:38:58 motherfunctor 05:40:33 e.g. if you have a category C with two isomorphic objects and two functors F, G : C -> C where F is the identity and G maps both objects to the first one (and arrows to the identity) 05:42:08 there should be "category theory for dummies" 05:42:50 @google "category theory for dummies" 05:42:50 http://homepages.inf.ed.ac.uk/jcheney/presentations/ct4d1.pdf 05:42:51 Title: Category Theory for Dummies (I) 05:44:33 lol 05:46:04 -!- MoALTz_ has joined. 05:49:03 -!- MoALTz__ has quit (Ping timeout: 250 seconds). 05:50:53 -!- tromp has quit (Remote host closed the connection). 05:51:28 -!- tromp has joined. 05:55:34 -!- tromp has quit (Ping timeout: 240 seconds). 05:58:50 Don't be so idiotic and play a DEFENDER card if it would be to your opponent's advantage for you to do so. 06:03:17 I was trying to think of use of necessity modal operator in Haskell, for example, to make the type specify only top-level values can be used (one way to do it is a class), and so on, would that be something like that? 06:03:54 What's with the error message "the connection was reset"? 06:05:44 Why is it shown to users in web browsers? Why not "closed" or "disconnected" or "aborted" or something? Are people expected to understand what "reset" means? 06:05:59 -!- Bike has quit (Ping timeout: 252 seconds). 06:09:43 shachaf: Reset is a normal english word 06:09:56 Yes. 06:09:58 Are people expected to understand what "connection" means 06:10:15 Jafet: Also a normal english word 06:10:19 What does this use of it have to do with the normal English use? 06:12:05 shachaf: Reset or connection? 06:12:21 reset 06:13:26 It does fit, though I suppose you are correct in that closed would be better 06:13:36 @wn reset 06:13:38 *** "reset" wn "WordNet (r) 3.0 (2006)" 06:13:38 reset 06:13:38 n 1: device for resetting instruments or controls 06:13:38 v 1: set anew; "They re-set the date on the clock" 06:13:38 2: set to zero; "reset instruments and dials" 06:13:40 3: adjust again after an initial failure [syn: {readjust}, 06:13:42 {reset}] 06:13:55 The connection was set anew 06:13:58 The connection was set to zero 06:14:05 The connection was adjusted again after an initial failure 06:15:45 @wn referer 06:15:46 No match for "referer". 06:15:47 Jafet: You're right, it doesn't make sense 06:17:22 I suspect most people do not actually read any text once they see the chrome://global/skin/icons/warning-large.png 06:17:58 (Why a warning symbol is used for errors is another story) 06:20:31 "The webpage at chrome://global/skin/icons/warning-large.png might be temporarily down or it may have moved permanently to a new web address." 06:20:38 got me where i wanted anyway 06:20:44 shachaf: Browser? 06:20:54 chromium 06:21:03 v34 06:21:25 Ah 06:22:34 -!- password2 has joined. 06:28:59 password2: Why not password? 06:29:09 ******** 06:30:08 because someone registered password 06:30:47 Is it actively used? 06:31:06 not as far as i know 06:33:42 Is there not a time period after which it becomes free? 06:33:59 dunno 06:34:04 -!- ^v has quit (Quit: http://i.imgur.com/Akc6r.gif). 06:36:34 aparently password was used once this year 06:36:58 registered and used 15 weeks ago 06:37:52 Guess its password 06:38:01 heh 07:36:46 -!- MoALTz_ has quit (Read error: Connection reset by peer). 07:37:33 -!- MoALTz_ has joined. 07:41:14 -!- impomatic has quit (Ping timeout: 258 seconds). 07:41:50 -!- zzo38 has quit (Ping timeout: 258 seconds). 07:43:48 -!- shikhout has joined. 07:44:18 -!- zzo38 has joined. 07:46:44 -!- shikhin has quit (Ping timeout: 245 seconds). 07:48:01 -!- edwardk_ has joined. 07:48:46 -!- AnotherTest has joined. 07:49:26 -!- edwardk has quit (Ping timeout: 276 seconds). 07:55:48 big beats are the best, get high all the time 08:14:19 -!- quintopia has joined. 08:18:04 -!- nucular has joined. 08:18:04 -!- nucular has quit (Changing host). 08:18:05 -!- nucular has joined. 08:30:21 @tell Taneb http://eso.mroman.ch/ESOSC/ESOSC-2014-D2-R1.pdf 08:30:21 Consider it noted. 08:48:45 -!- oerjan has joined. 08:50:34 -!- Patashu_ has quit (Ping timeout: 240 seconds). 08:54:00 -!- tromp has joined. 08:57:00 oerjan: i finished norge. i brought a bottle of the linie aquavit but did not yet try it 08:57:41 excellent 08:58:19 -!- tromp has quit (Ping timeout: 252 seconds). 09:02:03 the Florida psychic Sheree Silver disassociated herself from the practice, telling the Sun-Sentinel, "I can't imagine anyone wasting their time and money on someone like this when there are so many legitimate psychics out there." https://en.wikipedia.org/wiki/Rumpology 09:07:24 The irony? 09:08:18 -!- Phantom_Hoover has joined. 09:09:31 I wouldn't be interested in the future anyway unless I could change it 09:11:49 https://neocities.org/blog/the-fcc-is-now-rate-limited 09:20:23 is the FCC doing a lot of surfing on neocities? 09:21:38 That isn’t really relevant. 09:23:07 -!- password2 has quit (Ping timeout: 250 seconds). 09:24:24 mroman_: the twist is that you _can_ change the future, but only if you don't know it hth 09:24:29 why does a democratic nation have a bureau responsible for censoring stuff? 09:24:48 oerjan: ic. 09:25:21 so once a physic tells me my future it is carved in stone 09:25:28 wouldn't that give them supernatural power? 09:26:20 well most psychics don't actually know the future just potentialities hth 09:26:55 Why did I optimize the implementation of my algorithm for my bachelor thesis :( 09:26:59 that was sort of a stupid move to do 09:27:17 mroman_: you mean now you have nothing to do for your masters? 09:27:22 No. 09:27:42 Now all my tons of measurements I did are obsolete. 09:28:05 shocking (huh.) 09:28:11 yeah 09:28:24 and it's the last week of the bachelor thesis more or less 09:28:31 I've already documented and discussed my findings 09:28:39 and suddenly now everything is obsolete 09:30:26 eek 09:31:31 do you mean someone beat you to it 09:31:47 * oerjan doesn't quite understand 09:32:07 oerjan: Well 09:32:17 You gotta write a bachelor thesis repot of around 50 pages 09:32:28 documenting your stuff, measurements and conclusions from the measurements 09:32:40 no, since I've optimized stuff like hell 09:33:00 all those conclusions are somewhat useless now 09:33:16 because I've got something better now that scales differently 09:33:26 *now, 09:33:36 ah so you beat _yourself_. tricky. 09:34:18 (also I'm pretty sure someone in the world already beats me anyway) 09:34:24 and I'm not doing a masters btw 09:34:25 yep, you clearly should have left that for the masters. 09:34:31 ah. 09:34:44 I'd want a master from a university 09:34:51 if any 09:34:55 not the master I could do here 09:35:03 this isn't a university? ok. 09:35:38 * oerjan has a hunch it'll be called Hochschule 09:35:38 Nope. It's not. 09:35:47 oerjan: it is 09:36:46 norway also has this sort of folkehøyskole system parallel and somewhat lower in status to the universities 09:37:53 yeah 09:38:00 they run under the slogan "different but equal" here 09:38:09 ah 09:38:11 well... according to the "real" universities we're not equal ;) 09:38:20 and according to Hochschule we're equal but different 09:38:28 pick your side ;) 09:38:47 YOU ARE BREAKING LEIBNITZ RULE YOU INFIDELS 09:38:59 *LEIBNI... er let me look it up 09:39:10 Leibnitz made a rule? 09:40:11 -!- shikhout has changed nick to shikhin. 09:40:41 *LEIBNIZ LAW 09:40:53 *LEIBNIZ'S LAW 09:41:12 he also made several rules. someone should clean up the wikipedia redirections. 09:44:42 basically, the law that equal stuff has all properties in common. 09:45:07 which you can also formulate as the formal logical scheme a = b => (P a <=> P b) 09:48:11 I'm always confused with lemma, theorem and laws 09:48:33 Do you say "law" when it's really a "definition/axiom"? 09:49:59 looking at the philosophical mess "Leibniz's law" redirects to on wikipedia, i think the point is that leibniz wasn't really thinking about formal logic. 09:50:09 (not looking too closely, mind you) 09:50:37 although the formal scheme gets to be called the same thing by analogy. 09:51:03 and could in principle be used as the definition of equality. 09:52:16 some theorem proving systems might, but i vaguely recall some don't for technical reasons (impredicative types possibly) 09:52:17 That'd be the best definition of equality I know. 09:52:28 and probably the only one :) 09:53:36 but I don't know any definitions for a < b that'd hold 09:53:55 n < (n+1) isn't really a good definition at all 09:54:18 well = is a general logical principle but < refers to a particular order on a set 09:54:49 for reals you can use a <= b iff b-a is a square. 09:55:45 -!- password2 has joined. 09:55:50 because squares can't be negative 09:55:51 ic. 09:56:34 for naturals you can use a <= b iff b-a exists at all 09:57:28 (if you say, "but it exists as a negative number", then i will note that the real version also breaks if you include complex numbers) 09:57:59 there are no negative natural numbers 09:58:03 yep 09:58:16 *right 09:58:24 Why would I say it exists as a negative number :D 09:58:54 you might be quarrelsome and stupid like people usually are in these discussions on the internet hth 09:59:13 (HYPOTHETICALLY SPEAKING) 10:00:12 -!- conehead has quit (Quit: Textual IRC Client: www.textualapp.com). 10:00:18 I've had some discrete mathematics. Not much, but enough to know that in certain thingies certain other thingies just don't exist :) 10:00:27 *Groups 10:00:29 and stuff 10:00:40 I only know the german words for these things 10:01:20 Gruppenringkörper 10:01:25 :) 10:02:53 for natural numbers, < as the transitive closure of n < (n+1) isn't that bad. 10:03:58 i recall that logicians / complexity theorists have investigated how much extra power you get from allowing transitive closure on an otherwise very weak logic 10:04:46 Good morning 10:04:51 (i say / complexity theorists because it turns out that the smallest complexity classes have a strong correspondence with logic) 10:05:14 -!- KingOfKarlsruhe has joined. 10:06:35 good morning Taneb 10:11:14 mroman_, could we add a justification of the decisions made for second normal form to ESOSC 2014 D2? 10:16:35 Sure. 10:16:57 oerjan: I'm doing crowd simulation as my bachelor thesis 10:17:16 or "distribute it to multiple machines" to be more specific. 10:17:19 and well 10:17:31 It simulates 200k people in 11x realtime 10:17:40 I'm pretty sure somebody out there can do it in 0.1x realtime 10:19:05 (11x on a single machine) 10:21:29 Taneb: It's because they are "nops"? 10:21:35 and ][ is abused for comments 10:21:49 or what kind of justification did you have in mind? 10:21:52 That 10:22:34 although [...][foo] isn't first normal form 10:22:45 You only could have comments using brainfuck commands that way ;) 10:24:11 making comments in a language where no character can be included if it can be proved never to be executed sounds awkward. 10:24:49 Taneb: +- isn't a nop if cells don't wrap-around 10:25:06 i.e 255+ => 255- => 254 10:25:17 And <> isn't a nop if cells are bounded on the left 10:25:22 true 10:26:21 so snf kinda assumes wrap-around 10:32:29 Is second normal form necessary? It's more like a linter than anything else 10:32:52 I don't see any benifit of having it 10:32:56 but someone suggested it 10:35:07 *benefit 10:36:05 -!- KingOfKarlsruhe has quit (Read error: Connection timed out). 10:43:54 and judging by your question I assume it was nortti 10:46:13 We could remove it 10:46:17 -!- AnotherTest has quit (Ping timeout: 255 seconds). 10:46:22 but then it wouldn't make sence to have a "first" normal form 10:46:43 unless we're going to add one 5 years later or so 10:46:50 -!- password2 has quit (Ping timeout: 258 seconds). 10:47:24 hm. 10:47:34 ][ shouldn't assume wrap-around of any kind 10:48:35 -!- Patashu has joined. 10:49:38 -!- Patashu_ has joined. 10:49:38 -!- Patashu has quit (Disconnected by services). 10:58:51 http://eso.mroman.ch/ESOSC/ESOSC-2014-D2-R2.pdf <- well. I removed it for now 10:58:55 Suggestions still welcome :) 11:07:33 -!- Phantom_Hoover has quit (Ping timeout: 250 seconds). 11:08:10 mroman_, "Brainfuck" in both times in paragraph two should have a small b 11:08:39 In fact, whenever it's not at the start of a sentence or a heading (or possibly in "Normalized Brainfuck"?) 11:09:00 I thought names are writting with a starting capital letter 11:09:03 And instead of "interpreters (or compilers)", why not "implementations" 11:09:09 Brainfuck is weird 11:09:22 Look at its readme, for example 11:09:32 yeah 11:09:35 small letter 11:11:08 *written 11:11:39 to ease interpretation of brainfuck programs 11:11:45 that's gotta change too 11:11:54 I think 11:12:00 since compilers usually don't interpret them :) 11:12:24 well 11:12:49 to ease reading/handling/parsing? 11:13:05 implementation? 11:13:33 to ease implementation of brainfuck programs? 11:13:47 Hmm, no 11:13:56 parsing would be best 11:13:59 to ease writing brainfuck implementations? 11:14:04 Or thatr 11:14:05 or developing 11:14:11 I've got to go now 11:14:15 Bye! 11:14:20 bye 11:19:07 I think interpretation works 11:19:23 or maybe "comprehension" 11:23:06 mroman_: the one who suggested snf was b_jonas 11:26:36 heh 11:27:58 mroman_: 200k people? wow 11:28:06 that's a lot! 11:31:11 -!- yorick has joined. 11:42:28 -!- Slereah_ has joined. 11:42:47 -!- Slereah has quit (Ping timeout: 276 seconds). 11:43:52 if you serve any part of your domain at all over plain HTTP -- even the boringest static terms of service page -- then an active attacker has arbitrary code execution for that whole subdomain and can substantially mess with the entire domain 11:45:40 -!- drdanmaku has joined. 11:46:15 technically you don't need to serve anything as http do you? the attacker just needs to fool someone into _trying_ to load http from your domain? 11:46:57 which admittedly is probably somewhat easier if you have actual http pages. 11:49:19 ^ 11:50:52 b_jonas: 197133 to be precise 11:59:46 It can run 25k in about 1.1x realtime 12:02:27 @tell password2 (1) 15 weeks is the max upper limit for nick expiration (2) that particular nick actually goes under the special "not used more than 2 hours after registration" rule so expired after only 2 weeks. iow you can ask for it to be released. 12:02:27 Consider it noted. 12:04:56 does that mean that its use time is not 2h, or that is was only used before 2h had passed from registration? 12:05:11 the latter 12:05:45 It can't be used more than two hours before two hours after registration 12:06:16 * oerjan swats Jafet -----### 12:06:45 shaving -> 12:07:19 re https: if you live in a universe with compromised RAs -- even by the most bored iranian teenager -- it doesn't matter anyway 12:09:02 Some big websites even deliberately cycle multiple certificates, it's like they're asking for it 12:30:43 sadly I run out of memory with 1 Mio. people 12:48:45 -!- Sorella has joined. 13:02:34 CSS3 can do shadows, right? 13:03:04 -!- Dameon21 has joined. 13:05:25 yeah.... 13:05:37 but those browsers need some more of them anti-aliasing to make it look not terrible 13:10:27 -!- shikhout has joined. 13:13:14 -!- shikhin has quit (Ping timeout: 252 seconds). 13:15:29 -!- shikhin has joined. 13:18:44 -!- shikhout has quit (Ping timeout: 252 seconds). 13:22:38 -!- shikhout has joined. 13:22:52 -!- MindlessDrone has joined. 13:25:29 -!- shikhin has quit (Ping timeout: 245 seconds). 13:30:10 -!- Dameon21 has quit (Quit: Leaving). 13:32:54 Aaaaah my sideburns are asymettric 13:33:53 Taneb: http://eso.mroman.ch/ESOSC/ 13:34:10 border-radius is kinda nice 13:34:16 :) 13:34:34 Could you hyperlink "#esoteric" to webchat? 13:35:00 webchat.freenode.net? 13:35:30 does that take an argument for channel? 13:35:35 http://webchat.freenode.net/?channels=esoteric 13:36:29 k 13:36:30 *add* 13:36:50 Taneb: https://kiwiirc.com/client/irc.freenode.net/#esoteric 13:37:12 -!- test has joined. 13:37:16 hm. 13:37:18 works 13:37:28 -!- test has quit (Client Quit). 13:38:39 did we pass 13:41:36 pass what? 13:43:21 the test? 13:43:34 sure 13:44:17 yay 13:45:53 hm 13:46:00 the ISO indeed makes money by selling pdfs 13:46:23 Taneb: enjoy your lopsideburns 13:46:47 -!- impomatic has joined. 13:47:35 burning lobsters 13:52:10 -!- shikhout has changed nick to shikhin. 13:53:58 burning lobsters? 14:10:00 mroman_: how many committees and subcommittees does ESOSC have? 14:11:18 none at the moment 14:12:42 would you like to be in one? 14:13:31 ESOSC? What's that? 14:13:52 `? esosc 14:13:53 esosc is esoteric song contest (also Esoteric Standard Committee) 14:13:55 impomatic: http://eso.mroman.ch/ESOSC/ 14:18:17 -!- shikhout has joined. 14:18:29 I think the EsoAPI needs a revival 14:19:23 maybe a version that isn't dependant on cell-based langs? 14:19:58 -!- tertu has joined. 14:21:13 A standardised, improved esoAPI would be neat 14:21:17 -!- shikhin has quit (Ping timeout: 264 seconds). 14:22:07 also, a file-based disk-io instead of sector-based would be neat 14:29:40 -!- nooodl_ has joined. 14:30:14 -!- nooodl_ has changed nick to nooodl. 14:37:57 -!- tromp has joined. 14:39:59 -!- shikhin has joined. 14:42:34 -!- shikhout has quit (Ping timeout: 245 seconds). 14:45:28 -!- oerjan has quit (Quit: leaving). 14:53:20 -!- Patashu_ has quit (Ping timeout: 252 seconds). 14:54:18 Did the EsoAPI hook stdout/stdin? 14:55:18 looks like it 14:55:30 well 14:55:53 upcoming ESOSC-2014-D3 is EsoAPI Revised :) 14:58:45 wasn't D3 brainfuck conventions? 14:59:08 yeah 14:59:14 D4 14:59:23 ESOSC-2014-D4: Esoteric System Interface (ESIX) 14:59:26 something like that 14:59:33 mroman_: PSOX 14:59:49 PSOX? 14:59:52 Pee-Socs? 14:59:57 *Socks 15:00:05 Portable ...? 15:00:38 ah 15:00:55 PSOX from Sgeo 15:02:27 A guy from the IEEE Signal Processing Society Audio and Acoustic Signal Processing Technical Committee Challenges Subcommittee just said a few words. 15:03:12 (I'm at a workshop.) 15:05:36 That's what I'm saying, ESOSC needs more {,sub}committees 15:06:02 fizzie: did he present himself using that title? 15:06:18 (?:sub)*committee. 15:06:26 Almost. 15:06:46 (He wanted ideas.) 15:06:58 If you have an idea for a subcommittee and if you want to work in it just say so ;) 15:07:11 I'm btw. not really fond of APIs through stdin/stdout 15:07:31 except for that they are portable across languages and don't require any change in them 15:07:39 it looks kinda inconvenient 15:08:08 but PSOX looks kinda feature-rich 15:09:20 Hm 15:09:36 Wouldn't it be Esoteric Standard*s* Committee? 15:10:06 FireFly: It's a good idea to start out small. 15:10:27 I guess you could call it the standard standards committee 15:11:20 Also weird: conference proceedings on an USB stick that pretends to be both a USB mass storage device and an external CD ROM drive. 15:11:45 huh 15:11:48 I think the latter was read-only. 15:12:04 that's fine but not very original 15:12:12 iow, boring. 15:12:14 I can't think of any reason for the latter.. 15:13:14 FireFly: recall the floppy disks that had a notch that could be covered to make them read-only? 15:13:18 The "CD" had all the data and the stick was empty. 15:13:46 "the latter" as in pretending to be an external CD-ROM drive 15:14:06 So that would be a sensible use for such a setup to me, hardware level write protection. 15:14:12 Maybe it autoruns better. 15:14:23 -!- stuntaneous has joined. 15:14:26 -!- stuntaneous has quit (Excess Flood). 15:14:41 I guess 15:14:47 -!- stuntaneous has joined. 15:14:49 -!- stuntaneous has quit (Excess Flood). 15:15:04 Yeah. I've seen that, putting drivers on a USB "CD" drive. 15:15:15 But what is that idea doing at a conference?! 15:17:19 I have a USB 3G/GPRS stick that has a built-in "driver CD", of course with hopelessly outdated drivers. 15:17:50 Huawei? 15:18:04 Yes. 15:28:36 -!- shikhout has joined. 15:29:04 -!- idris-bot has quit (Quit: Terminated). 15:29:18 -!- idris-bot has joined. 15:31:44 -!- shikhin has quit (Ping timeout: 245 seconds). 15:42:20 -!- shikhin has joined. 15:45:17 -!- shikhout has quit (Ping timeout: 264 seconds). 15:45:26 -!- password2 has joined. 15:55:48 -!- conehead has joined. 16:03:11 -!- password2 has quit (Ping timeout: 252 seconds). 16:03:34 -!- conehead has quit (Disconnected by services). 16:04:37 -!- shikhout has joined. 16:05:36 -!- conehead_ has joined. 16:07:41 -!- shikhin has quit (Ping timeout: 258 seconds). 16:09:08 -!- shikhout has changed nick to shikhin. 16:09:17 -!- shikhin has changed nick to inshikhin. 16:10:30 -!- inshikhin has changed nick to shikhin. 16:15:15 -!- conehead_ has quit (Changing host). 16:15:15 -!- conehead_ has joined. 16:20:57 -!- conehead_ has changed nick to conehead. 16:22:56 -!- shikhin has quit (Ping timeout: 276 seconds). 16:24:08 -!- shikhin has joined. 16:25:26 -!- password2 has joined. 16:28:06 -!- quelqun_dautre has joined. 16:36:09 -!- shikhout has joined. 16:39:17 -!- shikhin has quit (Ping timeout: 264 seconds). 16:40:06 -!- yorick has quit (Remote host closed the connection). 16:49:36 -!- shikhin has joined. 16:52:18 -!- shikhout has quit (Ping timeout: 240 seconds). 16:53:08 -!- tromp has quit (Remote host closed the connection). 16:53:21 -!- tromp has joined. 16:53:38 -!- ^v has joined. 16:55:21 -!- tromp__ has joined. 16:57:59 -!- tromp has quit (Ping timeout: 255 seconds). 16:59:40 -!- edwardk has joined. 16:59:57 -!- edwardk_ has quit (Ping timeout: 265 seconds). 17:13:48 [wiki] [[Rasen]] M http://esolangs.org/w/index.php?diff=39484&oldid=39478 * Wolgr * (-42) 17:23:10 [wiki] [[Rasen]] http://esolangs.org/w/index.php?diff=39485&oldid=39484 * Wolgr * (-61) 17:25:42 -!- Bike has joined. 17:31:50 -!- augur has quit (Ping timeout: 276 seconds). 17:48:24 -!- augur has joined. 17:51:45 -!- shikhout has joined. 17:54:18 -!- shikhin has quit (Ping timeout: 240 seconds). 17:56:47 -!- shikhin has joined. 17:59:01 -!- MoALTz__ has joined. 17:59:18 -!- shikhout has quit (Ping timeout: 240 seconds). 18:01:22 -!- MoALTz has joined. 18:02:05 -!- MoALTz_ has quit (Ping timeout: 252 seconds). 18:04:25 -!- MoALTz__ has quit (Ping timeout: 250 seconds). 18:06:53 -!- tertu has quit (Ping timeout: 264 seconds). 18:09:20 hm 18:09:35 It's hard to balance simplicity, compilability and mightibility 18:09:46 wordmakeupability 18:09:55 i recommend bonghits 18:10:14 I'm trying to boostrap a self-hosting compiler 18:10:26 (with a language I'll invent) 18:10:48 the simpler the language, the easier to compile 18:10:53 exactly 18:10:55 the simpler the language, the harder to make a compiler 18:10:58 my last try even had a typesystem 18:11:05 no. 18:11:13 simpler language, simpler compiler *my opinion* 18:11:20 brainfuck's easy to compile 18:11:24 i mean... 18:11:26 but writing a brainfuck compiler in brainfuck 18:11:29 that's gonna be harder 18:11:30 the simpler the language, the harder to write a compiler in 18:11:36 that's what I meant 18:11:40 write a brainfuck to brainfuck compiler in brainfuck 18:11:46 or a 18:11:50 compiler compiler 18:11:53 that produces brainfuck code 18:12:18 writing a blc interpreter in blc is straightforward though 18:12:32 because blc is much more expressive than brainfuck 18:12:48 that is, binary lambda calculus? 18:12:51 yes 18:13:03 best lambda calculus 18:13:09 bonghit lambda calculus 18:13:37 of course it can't be too hard given that it takes under 26 bytes 18:14:02 tromp_, i've seen your web page about it, looks very interesting. except i barely understand anything :/ 18:14:25 i'd first need to learn and understand well lambda calculus 18:14:38 the wikipedia article should make a good introduction 18:14:47 then you can dive into my paper 18:15:29 i skimmed through it, what I like the most about it is the images. i find it fascinating to represent programs as graphs 18:15:52 yes, they're quite artistic 18:16:40 -!- shikhin has quit (Read error: Connection reset by peer). 18:16:40 to mock a mockinggraph 18:17:00 -!- shikhin has joined. 18:17:08 i have a big print of the predecessor function adorning my office wall 18:17:29 easily mistaken for modern art 18:17:42 link? 18:17:51 http://homepages.cwi.nl/~tromp/cl/diagrams.html 18:18:41 ah nice 18:19:17 tromp_, I want 18:19:45 -!- tromp__ has quit (Remote host closed the connection). 18:20:20 -!- tromp has joined. 18:21:27 are these always unambiguous? 18:21:34 yes 18:21:49 kewl 18:22:01 the haskell programs on my blc page create these images 18:22:07 in various formats 18:22:22 eg. png, ascii, ascii graphics... 18:22:38 do you have an interpreter which takes an image as input 18:22:45 nope:( 18:23:13 the image is quadratic in the size of the term 18:23:29 i remember something about blc used in studying program complexity. is blc the most compact representation of an algorith? 18:23:54 that's impossible to formalize, scoofy 18:24:27 it certainly hits a sweet spot in simlicity and expressiveness 18:24:36 * Taneb --> Eurovision party 18:24:46 but your blc interpreter is the smallest turing-compatible self-impreter, iirc 18:24:53 and i haven't seen any competitive alternative 18:24:55 -!- tromp has quit (Ping timeout: 258 seconds). 18:25:21 it's the smallest "honest" one 18:25:36 but again that's hard to formalize 18:25:54 i wonder about its performance. is the blc interpreter fast enough to make it sensible to run complex programs in it? 18:25:59 many languages have primitives that vastly simply self interpretation 18:26:03 simplify 18:27:12 the interpreter introduces little overhead 18:27:29 nice 18:27:36 so it could be very fast depending on the underlying reduction engine 18:27:55 so, in theory, it could be used for program compression? 18:28:16 creating very small programs is an interesting field 18:28:19 what programs do you have in mind? 18:28:37 it's hard because blc has no data primitives 18:28:47 no numbers, no nothing 18:28:56 just function application 18:29:31 also (optimal) compression is uncomputale 18:30:17 so... how would one start writing a blc program? 18:30:23 creating small blc programs (like the 1267 bit prime sieve) is a huge challenge 18:30:40 i mean 167 bit 18:30:41 presumably you can represent data same way as you do in good ol lambda calculus. 18:31:48 http://www.ioccc.org/2012/tromp/hint.html for some interesting sample programs 18:32:00 to me, writing blc looks like writing unlambda 18:32:18 the 8-bit self-interpreter represents bytes as length-8 lists of booleans 18:32:40 which is also used in the brainfuck interpreter 18:33:47 indeed blc is pure lambda calculus 18:33:56 with some binary IO conventions 18:36:05 http://codepad.org/XdQlMQwP <- so far I've come up with something like this now 18:36:44 is the list stored as (1 2 3 4 5 6 7 8) or (1 2 3 4 5 6 7 . 8) ? 18:37:30 (assuming it uses \xyf.fxy to construct the list) 18:38:06 as b7:b6:b5:b4:b3:b2:b1:b0:nil 18:38:07 -!- shikhout has joined. 18:38:38 where : is infix \xyf.fxy 18:39:25 why the b's 18:39:49 is nil False or the other possible nil? 18:39:54 bi is the i'th bit 18:40:13 yes, bil = false = \xy.y 18:40:25 i mean nil 18:40:38 and b7 is the MSB? 18:40:43 b7 is the most significant bit yes 18:40:58 -!- shikhin has quit (Ping timeout: 240 seconds). 18:41:53 -!- scoofy has quit (Read error: Connection reset by peer). 18:43:20 -!- scoofy has joined. 18:43:36 i ran the primes.blc program and it locked up my computer. had to hardreset 18:44:14 yes, it warns about that. only take the first 300 or so bits of output 18:44:28 didn't read that warning :/ 18:44:41 well, it printed about 10 lines of results fine 18:45:10 the c-program can do over a thousand bits 18:45:22 what happens after that? 18:45:24 -!- tertu has joined. 18:45:33 how did it bring a linux to knees? 18:45:34 it starts eating up your swap space:) 18:45:39 ah... 18:45:46 by allocating memory at insane rate 18:45:49 so it eats up all memory, i guess... 18:45:56 that doesn't seem terribly efficient 18:46:14 unary arithmetic is usually not 18:46:25 that's the price to pay for the shortest prime sieve program 18:46:35 I had a idea about another kind of modal logic operator, which is a "loop modality", which is always a theorem regardless what it is applied to. 18:46:38 it doesnt use any arithmetic 18:46:48 Maybe someone does something similar? 18:48:12 -!- password2 has quit (Ping timeout: 252 seconds). 18:52:35 hilbert.Blc works fine 18:57:42 going for a stroll; cul8r 18:57:58 -!- shikhin has joined. 18:58:20 wouldn't BLC be more compact if the de bruijn indices weren't unary? 18:58:37 yes, but also harder to encode 18:59:34 how so? 18:59:41 harder to write a universal machine? 19:00:24 -!- shikhout has quit (Ping timeout: 255 seconds). 19:06:04 Not using unary has overhead, too 19:07:23 -!- shikhin has quit (Ping timeout: 276 seconds). 19:08:38 How about using unary, but with a bias, so the numbering starts below zero 19:08:58 This makes it easier to refer to variables at some fixed distance to the current scope 19:09:02 how would one even do that? 19:10:37 I mean, how do you represent a negative num in unary without sign symbol, in which case it is better to just use binary 19:14:47 unary indices are close to optimal 19:14:49 -!- ^v has quit (Read error: Connection reset by peer). 19:15:02 because larger indices occur much less frequently 19:15:17 -!- ^v has joined. 19:15:21 technically, you don't even need any index > 2 19:16:12 is there some TC combinator system that only uses 2-arg combinators? 19:16:25 Uhhh 19:17:02 um what? 19:17:11 Some guy schoenfinkel made one 19:17:41 no, i think you need some 3 arg comb to construct S 19:18:03 @type ap 19:18:04 Monad m => m (a -> b) -> m a -> m b 19:18:51 Ok, bckw isn't one either 19:19:06 tromp_: won't you need index 3, then? 19:19:39 you need indices 0,1,2 or 1,2,3 :) 19:20:01 i sometimes start from 0, sometimes from 1 19:20:39 on that page i start with 1, so yes i need 3 then 19:21:19 oh, I see. I start from 1 since the first index in BLC is 10 19:21:44 -!- shikhin has joined. 19:23:05 -!- MindlessDrone has quit (Quit: MindlessDrone). 19:27:21 -!- shikhout has joined. 19:30:18 -!- shikhin has quit (Ping timeout: 240 seconds). 19:31:49 hm, i think i'm starting to understand it. so the 3 elements are: 'lambda', 'apply', and an index 19:34:15 00=apply, 01=lambda, 1(1*)0=index *. 19:34:27 mm. 19:34:39 no, 00=lambda, 01=apply. 19:35:30 I forgot about the \io trick, so the first thing in the primes program is actually a lambda. 19:35:40 wait, so 1110 is index 2? 19:35:43 yes, the prime program on http://homepages.cwi.nl/~tromp/cl/cl.html is color coded that way 19:35:50 oh, so you can do zero, ok 19:35:58 amazing that anything can be expressed in terms of that 3 things. 19:36:02 Bike: yes, I count from zero. 19:36:06 lambda in red, apply in green, vars in blue 19:36:15 color coding is fun :) 19:36:32 oh, the graphic notation is cute 19:36:35 good that you mention that, because I didn't notice 19:36:43 alternativell 3-symbol system would be binary combinatory logic, although that is bit of pita to program in 19:36:59 [wiki] [[Forobj]] N http://esolangs.org/w/index.php?oldid=39486 * GermanyBoy * (+6678) Created page with "'''Forobj''' is an object oriented programming language. It is designed to be easily extendable. == Overview == Forobj is a stack-based language. A program is a list of comm..." 19:37:00 -ll 19:37:57 [wiki] [[Language list]] http://esolangs.org/w/index.php?diff=39487&oldid=39456 * GermanyBoy * (+13) /* F */ 19:38:08 is there a project name generator on the fungot 19:38:09 fowl: not at all related to network fd readiness is dependent on fnord i got from the lists. 19:39:07 network fd readiness 19:39:13 also, real fast nora's hair saloon 3: sheer disaster download to bcl can be done with APPLY->01, LAMBDA->00, ONE MORE THAN->1, ZERO->10 19:39:24 Bike: he fd to means regular files on network filesystems 19:40:59 is that right, fungot 19:41:01 Bike: and it fnord. :) :) 3 :) at least for emacs users. 19:41:33 fungot, what's your favourite language? 19:41:36 b_jonas: http://en.wikipedia.org/ wiki/ fnord), and have vector-like-shuffler return a procedure from a symbol. 19:41:47 ah yes. classic. 19:42:52 [wiki] [[Forobj]] http://esolangs.org/w/index.php?diff=39488&oldid=39486 * GermanyBoy * (+240) 19:44:49 [wiki] [[Forobj]] M http://esolangs.org/w/index.php?diff=39489&oldid=39488 * GermanyBoy * (-1) 19:45:00 "Nuke OPENSSL_NO_SOCK since any half sane operating system has sockets." 19:45:14 ...why would OpenSSL even be used on a no socket system? 19:45:19 Oh, I guess key generation? 19:45:25 and other utilities? 19:46:08 -!- hk3380 has joined. 19:46:49 [wiki] [[Forobj]] http://esolangs.org/w/index.php?diff=39490&oldid=39489 * GermanyBoy * (+98) 19:47:27 there's probably some nut out there who thinks that to get a real secure system you can't just disconnect it, you also have to patch the kernel and libc to remove the socket syscalls 19:47:56 or someone who uses STREAMS 19:48:59 For every nut there are ten sysadmins who have to do the same thing because some bureaucrat said so 19:50:12 Are there actually any two-variable universal combinators? 19:50:42 Sgeo: the crypto algorithm implementations maybe 19:52:08 oh, and there should be plenty of systems where there are sockets, but they just don't look anything like bsd sockets 19:53:42 -!- MoALTz has quit (Quit: Leaving). 19:53:54 http://insanecoding.blogspot.ro/2014/04/common-libressl-porting-mistakes.html 19:54:49 -!- ^v has quit (Read error: Connection reset by peer). 19:55:15 -!- ^v has joined. 19:55:35 Well, you'd expect bsd programmers to assume bsd sockets. 19:55:56 -!- tromp has joined. 20:07:20 olsner: which? 20:08:34 http://en.wikipedia.org/wiki/Binary_Runtime_Environment_for_Wireless is one that I know of 20:09:34 mingw 20:10:00 (Though openssl probably has a winsock backend) 20:10:36 winsock's socket api is very close to bsd sockets though 20:12:39 -!- FreeFull has quit. 20:17:44 -!- ais523_ has joined. 20:19:06 -!- AnotherTest has joined. 20:20:28 hm. 20:20:32 *new idea* 20:32:43 * Sgeo goes to read http://insanecoding.blogspot.com/2014/02/http-308-incompetence-expected.html 20:36:47 I thought HTTP2 was supposed to be about the delivery, not header and status semantics 20:37:31 electric boogaloo 20:38:19 I also thought it was supposed to, but things wouldn't be very web if they made sense 20:44:01 The way to fix it, I think, would be to make the server check if HTTP2 is specified, and whether or not it is, post a "deprecated" notice mentioning all of these problems, and that you either need to fix your client or connect using an alternate protocol. 20:44:20 like gophers 20:44:26 Sgeo: hmm, looks like that post is not correct 20:44:55 e.g. 301 was *specified* some different way earlier, but never actually used in that manner 20:44:58 The way they describe is certainly too much more stupid, so one thing you can do is, check for HTTP2 and then complain 20:45:45 zzo38: olsner (and a comment on that page) is saying that the older spec didn't describe reality, and the HTTP2 change is meant to describe the current reality of what browsers actually do 20:45:49 Furthermore, don't use those codes if they cause problems. 20:46:39 -!- FreeFull has joined. 20:46:39 Sgeo: Perhaps, but they are probably both wrong. Especially if an unusual browser program is in use, or some other program such as wget is in use. 20:47:20 -!- edwardk has quit (Quit: Computer has gone to sleep.). 20:47:55 Everything web is wrong 20:48:00 still, reuse of already-existing code is a bad thing 20:48:05 +return 20:49:04 Sgeo: I think the upcoming HTTP/1.1-bis RFCs are the best description of current reality, the original HTTP/1.1 (RFC 2616) has some differences 20:49:07 -!- ^v has quit (Read error: Connection reset by peer). 20:49:34 -!- ^v has joined. 20:49:46 hmm, and those RFCs might be what he calls HTTP/2 20:49:52 we're naming standards with chem terms now? 20:49:58 Also, Google's servers do not even correctly implement the existing HTTP. Headerless requests will still respond with a header, and HEAD requests will sometimes return a 404 error even though a GET to the same file works. 20:51:38 httpbis is a working group, HTTP/1.1-bis is something I made up because I don't know what they're really called 20:52:05 well, that's still bis then. 20:54:06 -!- oerjan has joined. 20:54:49 i still love that the IETF mailing list about random number generation is named dsfjdssdfsd 20:57:24 * ais523_ goes on proggit and tries to correct some misconceptions about US copyright law 20:57:34 lots of people think that creating anything similar to someone else's API is now illegal 20:57:53 whereas the court decision was that you need a fair use reason to be able to copy function declarations literally 20:58:16 there is a huge amount of grey area in between, such as if you reimplement someone else's API but write the function declarations yourself 20:59:11 * ais523_ goes on proggit <-- noo you have so much to live for 21:01:29 What would the difference be between copying function declarations literally and reimplementing an API but writing the function declarations yourself? 21:02:14 Choice of parameter name is the only thing I can imagine, but that seems a bit.. thin 21:02:44 Legality, of course. 21:03:56 FireFly: the first involves copying them, the latter doesn't, and copyright is about copying 21:03:57 -!- Froox has quit (Quit: *bubbles away*). 21:04:20 the court actually said that copyright law was hard to apply to software, they described it like trying to solve a jigsaw where the pieces don't fit together properly 21:04:37 Oh, okay, so it's purely about the act of copying 21:04:38 in the latter case, you didn't copy the API, even if you happen to independently choose the same variable names 21:04:45 err, didn't copy the declarations 21:04:54 you did copy the API, if you did it based on API docs, but that's more abstract 21:05:02 if you go even further, and, say, reverse-engineer the machine code 21:05:09 then there's even less copying involved 21:05:16 In switzerland reverse-enginerring is allowed 21:05:19 (the court explicitly said they weren't making a ruling about reverse-engineering) 21:05:25 So if I implement someone else's API and by chance happen to choose the same parameter names (i.e. the source code of the two declarations is identical, modulo whitespace) I should still be safe, I guess 21:05:27 if you do it for interopability reasons 21:05:30 mroman_: in the US it's historically been found to be fair use 21:05:36 FireFly: yes 21:05:48 unless they can argue that you remembered the names from seeing their API docs, or something 21:05:55 I.e you would be allowed to reverse engineer a proprietary format so your software can export to it 21:06:10 most of the precedents come from DRM on games consoles 21:06:13 I guess that wouldn't hold for overly general and "obvious" names 21:06:14 You are also allowed to "copy" someone else's software by writing the same software yourself 21:06:28 FireFly: actually, the judgement wasn't that it holds for any particular name, but for a large collection 21:06:37 (which requires that you write it yourself, stealing their code is illegal of course) 21:06:38 Oh, that makes sense 21:06:48 like, it's OK to have a Math.max, so long as much of the rest of your API is different 21:06:54 of course, there's a lot of gray and black area there 21:06:59 -!- Frooxius has joined. 21:07:02 there are design patents and stuff and shit 21:07:03 Looking forward to the oddly-named parameter names that are copyright traps 21:07:03 so... 21:07:28 Jafet: haha, that would actually work, I think 21:07:39 ironically databases aren't protected by copyright laws 21:08:15 unless it is really special 21:08:22 That depends on the jurisdiction. 21:08:36 (And what kind of database) 21:08:51 A pure collection of data isn't worthy of copyright apparentely 21:09:41 this reminds me of the ruling that if you digitize a public domain work precisely enough (i.e. no creativity involved), the resulting digitization is also public domain 21:09:54 I had a semester "IT laws" 21:09:58 (whereas things like performing a public domain piece of music produce a copyrightable recording, because there's creativity in the way you perform it) 21:10:08 and what I've learned is: Nobody really knows what exactly is legal or illegal 21:10:15 mroman_: yeah, that seems about right 21:10:16 and you won't be sure unless a judge rules over it 21:10:21 except when a judge has ruled about it 21:10:25 Yeah. 21:10:31 It's like schrodingers cats 21:10:43 You don't know if what you're doing is illegal until a judge looks at it ;) 21:10:46 e.g. the only precedent we have about open source licenses in the US is that if there's an attribution requirement in the license, you can't reuse the work without attribution 21:10:54 (i.e. open the box) 21:10:58 that was a case where someone violated the Artistic License on model train controllers 21:11:19 but if they had given attribution, who knows? they were violating the license in other ways, but courts only care about determining that the license was broken 21:11:22 not solving hypotheticals 21:11:47 Even then, you don't really know until you bring it up with the appellate court or the relevant legislative body. 21:11:49 yeah 21:12:14 hypothetical scenarios are intentionally left open for law books (that cost 100$ and more) and for law students 21:13:12 of course, "you never know" holds for all kinds of other laws too 21:13:31 There's no official department where you can call for free and ask about what you intend to do is illegal or legal 21:13:41 and if the guy from that department says it's legal it REALLY is LEGAL. 21:14:12 and lawyers aren't really allowed to say "it's legal" too ;) 21:14:46 or at least, they are, just daren't 21:14:51 because they don't really know any better than anyone else does 21:14:58 Probably. 21:15:08 I think there's a decent random factor in court decisions 21:15:28 given how it depends on the lawyers that the sides have, who decides to submit an amicus brief, which judge is assigned, etc. 21:15:41 Yeah. 21:15:58 but the real problem is that you can't have a judge rule in *advance* 21:16:21 even if his decision were a little bit random... at least you know 21:17:00 you can in cases where you can show there's a real risk of being sued over something 21:17:01 That's a general weakness of our law system I think 21:17:15 just by registering a domain I'm one foot in a court 21:17:34 basically, if someone's making legal threats and not going through with them, you can effectively sue yourself to clear your name 21:17:43 There's nobody who can tell me conclusively if I'm allowed to register "mroman.ch" 21:18:57 I can do some database trademark searches 21:19:07 which aren't a 100% guarantee 21:19:13 I don't know any place in the world where registering domain names that are claimed by others is illegal 21:19:17 You just gotta register it anyway and hope nobody's gonna sue you 21:19:39 Jafet: It is in swizterland 21:19:48 You can't register a domain with "coca cola" in it 21:19:54 well you can 21:19:54 the vast majority of cases, if someone else does own the trademark, they'll settle rather than sue if you offer to give them the domain 21:19:56 but they can sue you 21:19:57 although you can't rely on that 21:21:55 You can design a GUI 21:22:03 for a opensource tool you wrote as a hobby 21:22:13 but you'll never know if somebody patented such a design 21:22:36 even if you pay patent researches 21:22:44 they can't tell you for *really* sure 21:22:48 (and it costs a lot) 21:23:14 http://www.usacryptocoins.com/thecryptocurrencytimes/uncategorized/dafuq-coin-the-first-malware-coin/ 21:23:19 (and as I imagine the US with even more crazier software patents... 21:23:34 I imagine it's probably illegal for any US citizen to write software) 21:23:48 Hmm, parking domains is actually illegal in amurica now 21:23:52 ion: looooool 21:25:01 mroman_: oh, I thought that was probably illegal a while ago 21:25:05 mroman: fortunately most patents are fairly easy to work around. 21:25:14 or maybe theoretically possible, but it's like the problem of trying to write a bug-free hello world 21:25:18 it takes a huge amount of effort 21:25:18 `coins 21:25:19 ​timcoin braulcafoarkulcoin plaincoin 305070coin rfectealcoin stracoin slmcoin @!coin opcrcoin parcoin orgertinoplincoin yencoin physixcoin famadncoin negringhaetacoin unacoin poicoin hypejocoin ming-boocoin huntingcoin 21:25:27 who put a rainbow on coins? 21:25:36 or has that always been there and I just never noticed due to filtering colors in the client? 21:25:41 rainbowcoin 21:25:47 ion: goddamn amazing 21:26:05 lol 21:26:18 'the first' 21:26:56 "[...] thanks to the investigative work of the owner of Bittrex, who was about to add Dafuq Coin to his exchange" 21:27:17 About to. 21:27:38 i cant wait until "finnsta" becomes standard american english 21:28:00 Finnish gangsta? 21:28:04 ais523_: fairly recent addition 21:28:20 `cat bin/coins 21:28:20 words ${1---eng-1M --esolangs 20} | sed -re 's/( |$)/coin\1/g' | rainwords 21:28:50 `coins --finnish --esolangs 10 21:28:51 ​@!coin 0x29acoin bdacal-xcoin insäcoin räisepolkcoin fundexcoin korecoin saancoin oikkalittercoin pohjuksencoin 21:29:13 "saancoin" sounds funny 21:29:20 "I get coin" 21:30:16 -!- AnotherTest has quit (Quit: ZNC - http://znc.in). 21:33:31 `run hg log bin/coins 21:33:32 changeset: 4627:64a2d83fa108 \ user: HackBot \ date: Sun May 04 18:20:25 2014 +0000 \ summary: echo "words \\${1---eng-1M --esolangs 20} | sed -re \'s/( |$)/coin\\1/g\' | rainwords" > bin/coins \ \ changeset: 4531:7f957c1f4661 \ user: HackBot \ date: Sun Mar 16 01:52:15 2014 +0000 \ summary: r 21:34:03 `run hg log bin/coins | grep '^date' | head -n 1 21:34:04 date: Sun May 04 18:20:25 2014 +0000 21:34:34 -!- Slereah_ has quit (Ping timeout: 240 seconds). 21:35:42 -!- nortti has changed nick to lawspeaker. 21:36:53 -!- lawspeaker has changed nick to nortti. 21:37:10 -!- Slereah_ has joined. 21:38:04 -!- ais523_ has quit (Quit: Page closed). 21:41:43 -!- Slereah_ has quit (Ping timeout: 252 seconds). 21:48:54 yeah it was kmc, he's the main user of the command anyhow. 21:53:27 http://files.shroomery.org/files/14-19/968666276-image.jpg 21:54:30 kmc: that facehugger's mushroom disguise isn't fooling anyone. 21:54:35 :D 21:57:07 -!- nortti has changed nick to lawspeaker. 21:58:06 -!- lawspeaker has changed nick to nortti. 21:59:28 http://www.mushroomexpert.com/clathrus_archeri.html 21:59:51 looks like a land octopus 22:00:03 yes 22:00:08 similar to the pacific northwest tree octopus 22:00:13 smells worse tho 22:07:43 -!- tromp has quit (Remote host closed the connection). 22:08:19 -!- tromp has joined. 22:10:12 -!- nucular has changed nick to nuculaway. 22:12:28 -!- tromp has quit (Ping timeout: 245 seconds). 22:20:16 -!- tromp has joined. 22:23:45 -!- Phantom_Hoover has joined. 22:36:00 -!- Patashu has joined. 22:36:29 -!- nuculaway has changed nick to nucular. 22:59:38 -!- Patashu has quit (Disconnected by services). 22:59:38 -!- Patashu_ has joined. 23:05:46 > (0$0 !!) 23:05:47 The operator ‘GHC.List.!!’ [infixl 9] of a section 23:05:48 must have lower precedence than that of the operand, 23:05:48 namely ‘GHC.Base.$’ [infixr 0] 23:05:48 in the section: ‘0 $ 0 !!’ 23:05:58 > (0$0 $) 23:05:59 The operator ‘GHC.Base.$’ [infixr 0] of a section 23:05:59 must have lower precedence than that of the operand, 23:05:59 namely ‘GHC.Base.$’ [infixr 0] 23:05:59 in the section: ‘0 $ 0 $’ 23:06:05 https://github.com/bridgetkromhout/devops-against-humanity/blob/master/first-printing-cards-DevOpsAgainstHumanity.csv 23:12:58 -!- tertu has quit (Ping timeout: 240 seconds). 23:16:56 -!- stuntaneous has joined. 23:21:55 ) (0$0 $) 23:21:55 FireFly: |syntax error 23:21:55 FireFly: | (0 $0$) 23:22:32 tromp: wow, the I/O handling in the IOCCC entry is nasty. (Am I right that U[-5]=96 can be reduced to U[-5] = 92? You need space for nil (4 entries) plus 8 cons cells with a bool (11 entries each), for a total of 11*8+4 = 92. 23:22:32 shocking 23:22:36 Huh. 23:23:29 Is Melvar still running idris-bot or is it someone else? 23:23:44 Same bot in #idris 23:23:53 I think so 23:23:55 > "Hello, idris-bot ignores me" 23:23:56 "Hello, idris-bot ignores me" 23:24:14 tromp: but the real nastiness is in the manipulation of the code pointer to perform loops in the auxilliary code generated by k(10,33). 23:24:28 tromp: well done. 23:25:48 int-e: it's been a while since i coded that. let me see if i can figure out my code... 23:31:38 tromp: hmm. well it doesn't work. 23:31:50 * int-e checks his own calculation. 23:32:04 maybe nil takes 8 entries 23:32:31 i have to check my lambda space encoding 23:32:34 dinner first... 23:33:12 -!- nucular has quit (Quit: Excess Food). 23:34:24 tromp: oh. I forgot an APP VAR0 part that goes together with the nil, which is another 4 entries. Sorry. 23:36:25 Sgeo: It’s the same, just someone was unhappy about the “slave” name, and it was decided it should be changed. 23:36:50 Melvar: what about the no > prefix here but yes > prefix in #idris 23:37:47 Sgeo: I thought that was how people wanted it? 23:37:58 Yes, just wondering how the change was made 23:38:17 Configs expanded to allow channel-specific configuration? 23:40:27 Well, I implemented configuration in the first place, such that per-channel is possible. 23:40:36 Help I made a Vine 23:53:58 Sgeo: So, as a default, interpPrefixes = ["> ", "( "] , but for #esoteric, interpPrefixes = ["( "] . 23:55:24 Do people actually use ( in #idris ? 23:57:41 No, I just decided it probably wouldn’t hurt.