00:00:49 I'm increasingly skeptical quantum computers will ever come to fruition <-- i'm optimistic, because i read shtetl-optimized hth 00:01:38 although with the possible option of "will hit some unknown physical obstacle which will _itself_ revolutionize science" 00:02:44 * oerjan notes diginet is 17 hours idle but finds @tell excessive. 00:04:16 or wait, he said more 00:07:38 @tell diginet mostly because one hasn't appeared yet <-- note that the really good theory for quantum computers requires reaching a reliability threshold before you can use error correction at _all_, and experiments have only _just_ started getting past that point. 00:07:38 Consider it noted. 00:25:06 1 = λs.0, 0 = λs.I, I = λx.x <-- i have a hunch that representation will be hard to use, especially if the numbers are unbounded 00:25:35 oerjan: I think I got it wrong, actually 00:25:50 well that's not church numerals, at least 00:26:00 It should be 1 = λs.s0, should it not? 00:26:13 but church numerals are probably not the only possible representation. 00:26:28 hm 00:26:54 you mean n+1 = λs.sn ? 00:26:55 oerjan: Of course; I read an article the other day where someone defined numbers as lists of T= 00:26:55 λxy.x an F=λxy.y 00:27:01 oerjan: Pretty much 00:27:10 And 0=λs.sI 00:27:33 I basically used church numerals in general but wrote the initial definition wrong 00:27:53 um that's not what i call church numerals either 00:28:41 oerjan: Basically, I'm trying to say church numerals but I forgot how they work 00:28:54 They used the binary list notation because they were going for the Lambda Calcular equivalent of adding on a TM 00:29:24 n = λfx.f(f(f(...(f(x))))) hth 00:29:55 Because λ-calculus's normal church numeral representation is horribly inefficient, and the Church-Turing Thesis or whatever says that all TC systems can do problems at the same rate or something like that 00:29:56 n+1 = λfx.f(nfx) 00:30:30 Like, if it can be done in Polynomial time on a TM, then it can be done in Polynomial Time in any equivalent system, including things like Minsky Machines and, of course, the λ-calculus 00:30:41 hppavilion[2]: that's simply wrong. 00:30:51 minsky machines have exponential slowdown. 00:30:59 oerjan: There's some theorem that says what I'm trying to get at 00:31:13 Let me check the article 00:33:24 oerjan: Ah, it's that anything that can be efficiently calculated can be efficiently calculated on a TM, or equivalently in λ-calculus. That's the strong Church-Turing Thesis 00:33:45 Where "efficiently" is "in polynomial time" 00:33:59 heh. 00:34:10 As a demonstration, he implemented a more efficient version of addition in λ-calculus 00:34:15 quantum computers are theorized to violate that btw 00:34:16 http://useless-factor.blogspot.com/2007/04/thoughts-on-church-numerals.html 00:34:24 oerjan: REALLY!? 00:34:27 AWESOME! 00:35:07 (I was about to say that I secretly hope that the Church-Turing Thesis is completely wrong, to the point of there being infinitely many machines more powerful than a TM, and preferably not following some predefined pattern) 00:35:11 yes, because they can do e.g. factorization in polynomial time, which is theorized not to be possible in polynomial time with a TM 00:35:20 oerjan: Wow. 00:35:44 also, i've heard that called the Extended Church-Turing Thesis over at scott aaronson's blog. 00:35:44 Is that, like, the church-quantum-turing thesis or something? Is there some metaquantum computer with a similar increase? xD 00:36:29 oerjan: Of course, quantum computers aren't "real" CS because they rely on the universe being shittily designed and a buggy piece of crap 00:36:32 xD 00:36:45 well the revised thesis would be that a quantum computer is optimal, since it is believed to be able to simulate any physical system. 00:37:30 oerjan: Is there such thing as a Stringy Computer that relies on String Theory? xD 00:37:31 Sounds like it would really help weather forecasters. 00:37:42 zgrep: As long as they enter ALL of the decimal places 00:37:51 "this universe is too fast, it must be buggy" O KAY 00:38:07 oerjan: Pretty much 00:38:21 "Let's scrap it and start over. Bring me some more energy, will you?" 00:38:35 If I were a god, I would create a universe in which all problems are solvable in n***n time 00:38:39 (*** is tetration) 00:38:43 hppavilion[2]: i dunno, although there's some theory about closed timelike loops from general relativity, if they existed might allow even greater efficiency. 00:39:03 (basically, time traveling computation) 00:39:09 I would not be a kind god to my universe's programmers. 00:39:30 oerjan: My god. I've been meaning to write a Wiki article on chronos.py, the Python library for time travel 00:39:56 oerjan: The same thing could be said about using Narnia for computation 00:42:03 well narnia's relative speed was somewhat unpredictable. i recall there was a point in The Last Battle where it was actually slower than Earth. 00:42:20 Huh 00:42:57 oerjan: Should I base Chronos on the wormhole-based timetravel? The one where you need to have a wormhole setup first to travel back through it? 00:44:06 ERM 00:44:11 IF YOU WANT 00:44:53 it's a nice way of solving the paradox of why we haven't noticed any time travelers yet. 00:45:21 oerjan: It's also the most likely solution I know of for time travel 00:46:02 -!- mihow has quit (Quit: mihow). 00:46:16 * oerjan gets an urge to link to the relevant tvtropes page 00:46:58 oerjan: Do so 00:47:15 stupid tvtropes has got popup ads 00:47:28 http://tvtropes.org/pmwiki/pmwiki.php/Main/OurTimeTravelIsDifferent 00:49:01 what is Chronos? 00:51:38 FireFly: The word or what I'm talking about 00:52:20 Your.. work 00:54:20 -!- gde33 has joined. 01:18:41 #esoteric will like this: http://codegolf.stackexchange.com/a/67949/3852 01:19:11 i've talked about "brainfuck programs whose output is longer than their code" in here before! 01:20:59 this time, you have to print an integer matching /[1-9][0-9]*/, longer than your code, and minimize that integer. i don't think the code given there is minimal 01:23:23 oerjan: Then link to All The Tropes wiki which has no popup ads, or disable popup ads, or preferably both. 01:24:14 in theory my browser has disabled popups. however these get through somehow. 01:24:47 i guess it may only disable actual new windows... 01:27:50 -!- jaboja64 has quit (Ping timeout: 276 seconds). 01:29:06 <\oren\> what popup ads? 01:30:06 Hmmm 01:30:30 -!- hppavilion[2] has quit (Quit: WALRUS MAAAAAAAAAAAAN). 01:30:42 <\oren\> hold on lemme try chrome 01:30:56 -!- hppavilion[1] has joined. 01:31:39 `? bracket 01:31:40 bracket? ¯\(°​_o)/¯ 01:32:03 `le/rn bracket/bracket? ¯\[°​_o]/¯ 01:32:06 Learned «bracket» 01:34:25 -!- dcentral has quit (Ping timeout: 260 seconds). 01:36:55 mauris: tricky task 01:37:14 -!- tromp_ has joined. 01:40:03 <\oren\> nope 01:40:59 -!- jaboja64 has joined. 01:48:31 Oooh 01:48:32 OOooh 01:48:33 OOOOH 01:48:45 I just had an idea for the Tower Defence game I'm making 01:48:50 A sort of pseudo-time travel 01:48:55 In the form of missions 01:50:32 If random temporal anomalies are enabled, sometimes a tower is sent back in time for you in a crisis. It fights for you, then it dies from Temporal Exhaustion. You have the mission to get an identical tower by a certain point in time and send it back, or the universe is unraveled by the paradox and you lose the game. 02:00:03 OK 02:00:23 -!- atslash has quit (Quit: This computer has gone to sleep). 02:02:47 hppavilion[1]: But... why does it die from Temporal Exhaustion? Why can't I have a tower appear from the future, and then send the very same tower back (after some repairs, of course)... 02:03:33 zgrep: Because that wouldn't be as much of a pain in the ass 02:25:19 -!- AlexR42 has joined. 02:28:16 hppavilion[1]: Well, towers could lose things over time, or get damaged, or something. And have to be fixed. 02:30:55 zgrep: Ooooh 02:30:58 I'll keep that in mind 02:31:29 The only thing I have coded so far is rendering and about a fifth of a bullet 02:31:39 Though the bullet is more of a test than a final game thing 02:32:16 I want to see a "Humorous Standardization" StackExchange 02:32:32 -!- andrew has joined. 02:32:34 Basically, you're given a task to efficiently implement a protocol for, and you do it. 02:40:36 zgrep: What do you think of that idea? 02:43:42 -!- andrew has quit (Remote host closed the connection). 02:46:37 -!- andrew has joined. 02:48:03 -!- oerjan has quit (Quit: Nite). 02:51:32 http://area51.stackexchange.com/proposals/93958/strange-standardization?referrer=ZiABwUx2idavPb19oRj8Gw2 02:53:36 -!- andrew has quit (Disconnected by services). 02:54:02 Dynastic Title Transfer Protocol? 02:54:05 -!- andrew has joined. 02:56:10 -!- jaboja64 has quit (Remote host closed the connection). 03:02:27 -!- jaboja has joined. 03:08:45 -!- AlexR42 has quit (Quit: Textual IRC Client: www.textualapp.com). 03:22:02 -!- hppavilion[1] has quit (Ping timeout: 246 seconds). 03:23:10 -!- jaboja has quit (Ping timeout: 272 seconds). 03:29:33 -!- bb010g has joined. 03:37:30 https://stackoverflow.com/questions/4456438/how-do-i-correctly-pass-the-string-null-an-employees-proper-surname-to-a-so dis 03:37:34 -!- jaboja has joined. 03:57:20 -!- dcentral has joined. 04:04:22 hppavilion[1] who isn't here: Isn't that called RFC? :P 04:08:10 -!- jaboja has quit (Remote host closed the connection). 04:12:24 zgrep: zgrellop. you should @ask hppavilion[1]. 04:14:40 -!- jaboja has joined. 04:34:35 -!- MDude has changed nick to MDream. 04:46:24 -!- hppavilion[1] has joined. 04:49:32 -!- boily has quit (Quit: TUNNEL CHICKEN). 04:54:18 -!- Sgeo has quit (Ping timeout: 256 seconds). 04:55:23 -!- andrew has quit (Disconnected by services). 04:55:47 -!- andrew has joined. 04:55:50 -!- Sgeo has joined. 05:04:23 -!- jaboja has quit (Ping timeout: 264 seconds). 05:16:50 -!- hppavilion[1] has quit (Ping timeout: 246 seconds). 05:17:32 -!- mauris has quit (Ping timeout: 246 seconds). 05:22:23 -!- jaboja has joined. 06:12:27 If you have a technical support service, you should also install a DTMF decoder that can display the number so that it can be use even in case some caller tries to push the numbers into the telephone. 06:20:12 Is there a computer program to emulate a fax modem so that you can send the fax by connecting the audio connection to the telephone directly? 06:23:50 -!- hppavilion[1] has joined. 06:29:27 <\oren\> zzo38: I don't know of such a program, but that would be useful to many people who have to deal with fax-using fogeys 06:29:47 <\oren\> especially if it was an android app 06:30:35 For doing portable faxes yes, although I mean one that can be used even without Android-based system even just use a C program 06:38:26 I mean to be able to send a fax in case you do not have a fax modem. 06:44:02 I do not know of one either. 06:49:17 In many hotels the telephone has a data port so that you can connect your own equipment, possibly including fax; I have even seen one hotel room that has a telephone line on the wall that specifically says "fax". But if it can be done by computer software and if they will tell you which is the internal telephone number by computer fax then maybe you do not have to pay extra for an external call. 07:30:05 hppavilion[1]: I want to see a "Humorous Standardization" StackExchange <-- Isn't that simply an RFC? :P 07:30:26 s/RFC/IETF RFC/ 07:30:29 zgrep: Yes, but this one allows people to make their own 07:30:38 Ah. :P 07:30:40 zgrep: http://area51.stackexchange.com/proposals/93958/strange-standardization-and-domain-specific-languages 07:49:35 -!- copumpkin has quit (Ping timeout: 240 seconds). 07:49:45 -!- Patashu has joined. 07:59:47 -!- trn has quit (Quit: quit). 08:14:06 -!- jaboja has quit (Ping timeout: 240 seconds). 09:18:35 -!- bb010g has quit (Quit: Connection closed for inactivity). 10:01:39 -!- trn has joined. 10:08:33 -!- dende has joined. 10:13:41 -!- dende has quit (Ping timeout: 276 seconds). 10:37:26 -!- hppavilion[1] has quit (Ping timeout: 246 seconds). 10:37:45 -!- atslash has joined. 10:51:33 -!- tjt263 has joined. 11:09:04 -!- Welo has joined. 11:19:43 -!- atslash has quit (Quit: This computer has gone to sleep). 11:32:20 `? disney 11:32:23 `? mickey mouse 11:32:26 `wisdom 11:32:31 trick/A trick learnt is a trick half forgotten. 11:32:32 mickey mouse? ¯\(°​_o)/¯ 11:32:32 disney? ¯\(°​_o)/¯ 11:33:37 filo? 11:44:05 Not explicitly so. 11:47:04 -!- mauris has joined. 11:56:52 `perl -esleep$_,warn$_ for 10 11:56:54 `perl -esleep$_,warn$_ for 2 11:56:59 2 at -e line 1. 11:57:03 10 at -e line 1. 11:57:09 `perl -esleep$_,warn$_ for 2 11:57:10 `perl -esleep$_,warn$_ for 10 11:57:12 2 at -e line 1. 11:57:21 10 at -e line 1. 11:57:55 Probably just executing multiple commands in parallel, and printing whichever finishes first. I don't know how the file writes work though. 12:09:43 It's complicated. 12:09:53 Involving running the same thing twice. 12:11:04 I keep forgetting the details too, but there are some corner cases you can hit that produce unexpected results. 12:12:10 I know that jevalbot doesn't handle this properly: if you run two statements at the same time, then the changes in the environment by the one that ends first are completely lost, even if the command that ends second doesn't change anything, 12:12:33 and the bot gives no easy way to lock or anything. 12:12:57 So you just have to be careful not to run other statements while state-changing statements are running. 12:13:19 HackEgo's things act on separate repository checkouts, so they don't trample over each other. 12:13:24 There's a rarely used command to run a statement without state, but that doesn't even _read_ the state, not only doesn't write it. 12:13:41 -!- Patashu has quit (Ping timeout: 246 seconds). 12:14:19 If I ever rewrite jeval, I'll have to change this system to something saner, possibly simply to waiting till the previous command on the session finishes. 12:14:35 But it's not very likely that I'll rewrite it. 12:14:57 And I seem to recall HackEgo also does a global lock when it's doing the second run that actually does the changes that get committed, so that the changes themselves are serialized. 12:24:22 Yeah, verified. The transaction logic is approximately: Do a shared lock, run the command in a fresh checkout, get the output. If the checkout is not dirty, write the output and finish. Otherwise, obtain an exclusive lock, clean and update the checkout, run the same command again and commit the changes it made. Write out the output from the second run. 12:24:53 Where "write the output" means saying it out loud on the channel. 12:29:42 And "run the command" means spawning a new UML sandbox. Since the only persistent state is the version control checkout, and that's cleaned + updated before running the command a second time, it's normally not really visible that things that modify the persistent files get executed twice. But there were some special cases where you could tell. 12:51:20 fizzie: I see 12:51:53 `wisdom 12:51:56 herbalist/An herbalist is a list of herbas. 12:52:03 `wisdom 12:52:05 mathematimu/A mathematimu is a quantum of mathematics. If you observe it, its codepoint can change. 12:52:44 `wisdom 12:52:46 ocean/The Pacific Ocean is half the world and surrounded by fire. The Atlantic Ocean is less cool than its giant underwater mountain range. The Arctic Ocean is cold. The Indian Ocean is full of typhoons and non-Eurocentric shipping. 12:53:47 `wisdom 12:53:48 ngevd/ngevd is a fake wisdom entry because having an actual infinite file in wisdom/ makes all manner of stuff bloody awkward. `? ngevd is special-cased in bin/?. leave this file alone Phantom_Hoover‼ also t​swett‼ 12:54:09 `wisdom 12:54:11 caps lock/CAPS LOCK IS CRUISE CONTROL FOR TIRED OLD MEMES 12:57:11 -!- andrew has quit (Ping timeout: 264 seconds). 13:00:07 `? flying 13:00:08 flying? ¯\(°​_o)/¯ 13:00:10 `? flying car 13:00:11 flying car? ¯\(°​_o)/¯ 13:00:14 `? future 13:00:16 We know nothing about the future. 13:28:24 -!- copumpkin has joined. 13:58:52 -!- J_Arcane has quit (Ping timeout: 265 seconds). 14:06:22 -!- Phantom_Hoover has joined. 14:40:10 -!- Welo has quit (Quit: Leaving). 14:59:56 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 15:15:36 -!- Welo has joined. 15:16:39 -!- atslash has joined. 15:19:21 -!- mauris_ has joined. 15:22:29 -!- mauris has quit (Ping timeout: 265 seconds). 15:27:54 -!- Welo has quit (Quit: Leaving). 15:37:14 -!- atslash has quit (Quit: This computer has gone to sleep). 15:45:55 -!- Welo has joined. 15:54:53 -!- heroux has quit (Ping timeout: 246 seconds). 16:03:30 -!- mauris__ has joined. 16:05:36 -!- mauris_ has quit (Ping timeout: 250 seconds). 16:12:07 -!- J_Arcane has joined. 16:15:14 -!- MDream has changed nick to MDude. 16:23:22 -!- boily has joined. 16:28:37 -!- ais523 has joined. 16:38:37 -!- Welo has quit (Quit: Leaving). 16:41:45 @metar CYQB 16:41:45 CYQB 301614Z 06011KT 1 1/2SM -FZDZ -SG BR BKN008 OVC013 M08/M09 A3030 RMK SF5SC3 VIS VRB 1-2 SLP268 16:42:00 -SG? 16:43:40 Snow Grains ← http://meteocentre.com/doc/metar.html (WMO Code Table 4678) 16:54:11 -!- Welo has joined. 16:54:33 -!- Welo has quit (Client Quit). 16:55:47 @metar ESSB 16:55:47 ESSB 301650Z 16009KT CAVOK 01/M02 Q1033 R12/19//74 16:56:09 FirelloFly. 16:56:38 Sad that the really nearby airstrip closed 2006 16:57:00 It used to be ESCN 16:58:02 @metar ESCN 16:58:02 No result. 16:58:10 no results anymore... 16:58:34 it would be neat to have a voronoi diagram of the earth's surface, split by ICAO codes. 17:02:47 -!- mauris__ has quit (Read error: Connection reset by peer). 17:03:13 -!- mauris__ has joined. 17:14:46 -!- bb010g has joined. 17:27:53 -!- TieSoul has joined. 17:33:02 -!- TieSoul has quit (Ping timeout: 260 seconds). 17:41:19 -!- boily has quit (Quit: ERSATZ CHICKEN). 17:42:23 -!- TieSoul has joined. 18:23:42 -!- dcentral has quit (Remote host closed the connection). 18:27:05 -!- atslash has joined. 18:28:03 -!- jaboja has joined. 18:29:28 -!- mauris_ has joined. 18:32:05 -!- mauris__ has quit (Ping timeout: 255 seconds). 18:35:02 -!- mauris__ has joined. 18:38:08 -!- mauris_ has quit (Ping timeout: 250 seconds). 18:44:00 -!- heroux has joined. 18:47:26 [wiki] [[WhoScript]] http://esolangs.org/w/index.php?diff=46034&oldid=46021 * MCS-Kaijin * (+1) 18:58:29 -!- ais523 has quit. 19:01:51 -!- jaboja64 has joined. 19:05:34 -!- jaboja has quit (Ping timeout: 272 seconds). 19:12:33 -!- mauris__ has changed nick to mauris. 19:37:12 -!- hppavilion[1] has joined. 19:40:57 -!- TieSoul has quit (Remote host closed the connection). 20:06:20 -!- mihow has joined. 20:14:48 -!- Phantom_Hoover has joined. 20:16:46 [wiki] [[Special:Log/newusers]] create * Icezen * New user account 20:46:35 -!- jaboja64 has quit (Ping timeout: 240 seconds). 21:07:20 -!- TodPunk has quit (Ping timeout: 255 seconds). 21:10:10 -!- Phantom__Hoover has joined. 21:10:58 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds). 21:13:12 -!- TodPunk has joined. 21:36:42 -!- jaboja has joined. 21:38:36 -!- bb010g has quit (Quit: Connection closed for inactivity). 21:42:34 `wisdom 21:42:47 pie/I like pie \ I like pie 21:42:57 me too! 21:55:13 Why is it there twice, though? 21:55:32 fungot: What are your opinions regarding pies? 21:55:32 fizzie: but humans can understand the reasoning behind the fnord. on fnord, i think 21:56:17 -!- ais523 has joined. 21:57:09 -!- trn has quit (Quit: quit). 22:02:29 fungot: I don't know if they serve pies with fnord 22:02:30 FireFly: of course it wouldn't help in this case, more than anybody on d) ( lambda ( elt) ( display 22:14:50 -!- jaboja has quit (Ping timeout: 255 seconds). 22:16:19 Oh no! The diplomat delivering $2.5 million USD to me is stranded "at Airport". 22:17:05 fizzie: I assume this is the first you've heard of the diplomat in question? 22:17:11 * ais523 wonders if there's a settlement named Airport 22:18:23 Yes. Also it's a very ambiguous message genderwise. 22:18:46 your gender, the diplomat's, or the sender's? 22:18:55 The diplomat's. 22:18:57 "Send your address and phone number to him today and assist hER when She contacts you for more direction. His name is paul william, he arrived at your Airport yesterday with your package and She will need to proceed to your address immediately after her first delivery --" 22:19:19 Or maybe they're talking about two different people. 22:20:08 this reminds me of an infamous line from megaman battle network 4 22:20:20 I can't remember the exact wording but it was something like "what a polite young man she was!" 22:20:30 (I can't remember the gender of the person it referred to, either) 22:22:16 I can also call Richard Bruno, who is a director. They don't mention why I should, just that I can. 22:27:22 -!- oerjan has joined. 22:27:34 -!- jaboja has joined. 22:28:11 -!- jaboja has quit (Remote host closed the connection). 22:44:35 [wiki] [[Special:Log/newusers]] create * Tormaroe * New user account 22:48:56 -!- trn has joined. 23:05:04 -!- Elronnd has changed nick to earenndil. 23:07:24 -!- mauris_ has joined. 23:11:32 -!- mauris has quit (Ping timeout: 255 seconds). 23:15:23 -!- boily has joined. 23:16:13 bonsoily 23:16:35 -!- mauris has joined. 23:19:32 -!- mauris_ has quit (Ping timeout: 265 seconds). 23:23:30 bonsœrjan. 23:23:43 people on our minecraft server are doing mysterious things. 23:23:44 happy new year 23:24:00 b_jhellonas. already?!?!!!???11!!one!!?six???6?? 23:24:08 no, in advance 23:24:26 b_jonne annéeas! 23:24:32 because I might not be here on the channel at the time the new year actually starts 23:25:19 I'll probably not be there either. we're going to far away places to visit my grandma tomorrow and back. 23:25:37 good 23:26:22 @metar CYRJ 23:26:22 wait... six? 23:26:23 CYRJ 302322Z 27003KT 2SM -SN OVC012 M12/M14 A3013 RMK SN3SC5 SLP223 23:26:27 `? six 23:26:29 `? 6 23:26:31 `? ? 23:26:37 6? ¯\(°​_o)/¯ 23:26:37 ​? is wisdom 23:26:37 six? ¯\(°​_o)/¯ 23:26:40 yes, Shift-6 produces ?. 23:26:45 huh 23:27:05 isn't that on shift-slash or shift-comma? 23:27:10 1!, 2@, 3#, 4$, 5%, 6?, 7&, 8*, 9(, 0), -_, =+. 23:27:26 Shift-/ is \. 23:27:30 Shift-, is '. 23:28:09 that doesn't even make sense. that would require extra transistors. 23:28:22 it's shift-slash because it's 16 over slash 23:29:04 /1234567890-=qwertyuiop^çàasdfghjkl;èzxcvbnm,.é 23:29:25 \!@#$%?&*()_+QWERTYUIOP¨ÇÀASDFGHJKL:ÈZXCVBNM'"É 23:29:36 (mind you, ^ and ¨ are dead keys.) 23:30:09 what... is that some sort of saner french layout than the azerty one? 23:30:50 Is it a Canadian layout? 23:31:03 and where's ù ? 23:32:04 it's sane! it's one of the two French Canadian layouts. 23:32:32 I don't have a dedicated ù on this keyboard (ANSI key layout). I have to hit AltGr-` then u. 23:32:54 (œ is also missing, but I can understand that, nobody likes mayonaise) 23:33:06 I use us international altgr dead keys 23:33:07 œ is RightCtrl-Œ. 23:33:27 what 23:33:35 RightCtrl-what? 23:33:36 Right Control, then E. 23:33:40 ah 23:33:49 and the ørjanletter is RightCtrl-o. 23:33:49 crazy 23:34:02 óerjan 23:34:04 crazy 23:34:23 táńéĺĺé. 23:34:55 for comparison, here's the insane layout I use: http://www.math.bme.hu/~ambrus/pu/keymap 23:35:43 http://blog.docker.com/2015/12/ian-murdock/ ← damn :( 23:36:14 ambrus? 23:36:16 I'm just using UK QWERTY because I'm boring 23:37:42 boily? 23:39:01 T_T 23:39:04 just wondering whence the term "ambrus" come from. 23:39:08 coppro: yup. 23:39:36 boily: um, it's a name. it's related to some old Saint or something. 23:39:46 or more than one. 23:40:12 -!- jaboja has joined. 23:40:14 it wasn't, like, invented by my parents, they just decided to call me that. 23:40:30 I know because there are older people called Ambrus than me. 23:40:45 Funnily it's about half-and-half used as a family name and a given name. 23:42:35 b_jonas: So that means that ~25% of people with "ambrus" in their name are named Ambrus Ambrus? 23:42:50 Or something like that 23:42:52 hppavilion[1]: no, I don't think so 23:43:00 b_jonas: Statistically speaking 23:43:06 nope 23:43:20 People often speak "statistically" but rarely "probabilistically" 23:43:34 b_jonas: Where did I screw up on the math? I did it somewhere, I'm sure. 23:43:48 it's not that a frequent name, so no, and also half of the people with Ambrus as a family name are female and so can't have Ambrus as the given name 23:43:52 hppavilion[1], you assume that the two are independent 23:43:53 hppavilion[1]: you assumed that half of all people have ambrus as a first name, and half of all peopel have ambrus as a surname 23:43:56 and that the two are independent 23:44:02 the first assumption is probably the larger one 23:44:08 So you are making many fallacies 23:44:16 Taneb: even if they're independent it won't work 23:44:22 ais523: I mean only people that have "ambrus" in their name 23:44:24 -!- jaboja has quit (Read error: Connection reset by peer). 23:44:25 In the first place 23:44:26 b_jonas, yes, I realise that now 23:44:29 I observed a green apple, therefore by the Paradox of the Ravens all Hungarians are named Ambrus Ambrus. 23:44:31 I know I did the math wrong, I'm sure of that 23:45:03 It should probably be (percentage of people with name "ambrus" in their name out of all people)**2 or something like that for the entire population 23:45:04 boily, I don't believe I've ever met a hungarian to my knowledge not called Ambrus Ambrus 23:45:16 Although I have a friend whose surname is Toth who traces her descent to Hungary 23:45:28 hppavilion[1]: that doesn't make a difference though, if you're assuming independence (and if not the formula doesn't work anyway) 23:45:32 So I presume there at least used to be some Toths in Hungary 23:45:35 the fact that you're only including people with at least one ambrus 23:45:50 actually the calculation is wrong anyway, it should have come to a result of ~33% due to overlap double-counting 23:45:54 ais523: Which I was 23:46:03 It's hard to get precise statistics because it's not among the most common names. It's probably among the first 1000 most common male given names, but definitely not among the first 100. 23:46:04 Oh right, overlap 23:46:12 boily: I checked Shrodinger's box, therefor Walrus God 23:46:23 b_jonas, is Toth a heard-of Hungarian surname? 23:46:31 hppavilion[1]: assume 1% of people have ambrus as a first name and 1% have it as a surname, then with independence, 0.01% of people have it as both 23:46:33 What happens if you put a Shrodinger box in another Schrodinger box? 23:46:47 There's a 50% chance that there's a 50% chance that the cat's still alive? 23:46:53 [wiki] [[Ropy]] N http://esolangs.org/w/index.php?oldid=46035 * Tormaroe * (+6829) Created page with "'''Ropy''' is a stack-based, two-dimensional [[esoteric programming language]] invented in 2012 by Torbjørn Marø. In many ways it works the same as [[Befunge]], but with a d..." 23:46:53 meaning that 1/199 of people with at least one ambrus have two 23:46:57 -!- jaboja has joined. 23:47:17 Taneb: yes, it's common, although it's usually spelled Tóth here, but many people outside of Hungary spell it Toth, including the guy whose homepage is http://www.vttoth.com/ 23:47:19 Like, the inner Shrodinger box being turned on depends on the outer one activating 23:47:30 It's Schrodingers all the way down 23:48:25 hppavilion[1], it's all linear algebra in the end 23:48:49 Phantom__Hoover: It's all combinatory logic underneath that 23:48:49 b_jonas, how is it pronounced? 23:50:46 ais523: right, except there's probably only on the order of magnitude of 1000 people called Ambrus, so the intersection would be less than 1 person, if it was independent. though given the stupid names parents give to their children, there's somewhat better odds that someone is or was actually called Ambrus Ambrus. 23:50:58 I got WalText2i for my new WalrusOS working :) 23:51:11 Well, the argument parsing at least 23:51:18 There are definitely some people with the same given name as family name. 23:51:55 And also lots of people whose given name is otherwise a bad match for their family name, because the parents didn't think. 23:52:19 b_jonas: Hugh Gerection. 23:52:39 (Yes, Hugh spelled like that, not the correct way) 23:53:22 hppavilion[1]: I'm not sure there is a "proper way" with names 23:53:28 "hugh" is one of the most common spellings of that name thouh 23:53:30 *though 23:53:33 [wiki] [[Ropy]] http://esolangs.org/w/index.php?diff=46036&oldid=46035 * Tormaroe * (+1138) /* How it works */ 23:53:45 ais523: There is, some people just ignore it because they're idiots 23:54:17 Luckily, my parents gave me a name that isn't so uncommon that it's stupid and that is actually spelled the proper way. 23:54:29 "hppavilion"? :-) 23:54:42 not that uncommon, and spelled correctly apart from possibly a missing space and capital P 23:55:16 ais523: xD 23:56:20 There are a lot of names that are also given names: Balázs, Lukács, László, Jakab, Sándor, Kelemen, Antal, Pál, Illés, Jónás, Máté, Gáspár, Orbán, Virág, Barna, Tamás, Péter, Márton are all on the table of the 100 most common family names, with Vincze as an honorary mention. 23:56:26 For WalText2i, should I reset the env after each character, or should I leave it untouched so you can glean information about the previous character? 23:56:34 Crazy, I didn't realize there were that many common ones. 23:57:00 e.g. a character definition ends with `end=x+yi`, so you can then work from `end` on the next character 23:57:06 b_jonas: hmm, some of those names have obvious equivalents with English names, others don't 23:57:14 -!- boily has quit (Quit: SEVENTH CHICKEN). 23:57:21 My god... 23:57:24 The seventh chicken... 23:57:30 ais523: sure, because like half of the common given names in Hungary are actually biblical names 23:57:55 and the same is true in some English-speaking countries 23:58:00 (with one interesting odd one out: "László", often misspelled or misaccented, is recognized as being Hungarian but reasonably recognizable as a name in English despite that) 23:58:03 Mária is the single most common given name in Hungary 23:58:26 ais523: sure, it's recognizable because Lovász László (sr) is so famous 23:58:43 btw, László is now apparently the most common given name in Hungary 23:58:44 that's strange 23:58:50 It's Schrodingers all the way down <-- see https://en.wikipedia.org/wiki/Wigner%27s_friend hth 23:59:01 I thoguht it was stil József, but nope, all the Józsefs got old and died apparently or something 23:59:19 name fashions change a lot 23:59:55 there's always some newly fashionable name that everyone gives to babies, which is rare among adults but quickly gets common in the age group of that baby