←2019-05-24 2019-05-25 2019-05-26→ ↑2019 ↑all
00:00:03 <fizzie> "Already on floor three! Review your floor!"
00:00:08 <b_jonas> hehe
00:00:31 <b_jonas> can you enter a number with no matching floor?
00:00:53 <fizzie> Yes, because it's got a 0-9 number pad and there are floors up to 11.
00:01:00 <fizzie> So it's possible to enter 12-19.
00:01:01 <b_jonas> why is there even speech?
00:01:05 -!- sleepnap has left.
00:01:31 <fizzie> (For 2-9 and 9, it auto-terminates at the first digit. But for 1 it waits a little for a next digit.)
00:01:53 <fizzie> I think it just says something like "floor does not exist" or "invalid floor" if you do though.
00:02:14 <b_jonas> so... there's one less buttons than floors?
00:02:19 <b_jonas> one fewer buttons than floors
00:02:28 <b_jonas> or two fewer?
00:02:32 <b_jonas> is there a floor 0?
00:02:39 <fizzie> Yes, that's the ground floor here.
00:02:50 <b_jonas> ok, so two fewer buttons
00:02:55 <fizzie> There's also some basement floors, which I'm actually not sure how you input. Maybe there's a minus sign button?
00:03:24 <fizzie> But they could've had the same amount of buttons as floors, I'm sure it's just a standardized part.
00:04:01 <fizzie> Also, there's a "group" button, which earlier you could use to say "we're 10 people and we're all going to floor 8", by typing in <group>, 1, 0, wait, 8.
00:04:13 <fizzie> But they disabled the group button, rumour has it due to abuse.
00:04:15 <zzo38> I think maybe it should always require the same number of digits, or require to push enter afterward, is better than just trying to guess if you finish or not
00:04:29 <fizzie> I think that too.
00:05:18 <zzo38> (It would also be better for the group function, You can push 1 0 <group> 8 <enter> instead of <group> 1 0 wait 8)
00:06:58 <ais523> fizzie: I think most control panels for lifts consolidate multiple requests to go to the same floor, which would prevent that sort of abuse but also mean that specifying group size would be pointless
00:07:14 <b_jonas> ais523: I think I have a solution.
00:07:34 <zzo38> Yes, you should not need a group size usually, I find it works without
00:09:12 <fizzie> ais523: I think the intent of the group thing was that the scheduler could know a priori you will need that amount of empty space, and can't pick up more than so many passengers along the way.
00:09:14 <b_jonas> ais523: each philosopher shall have a mutex and a condvar. when a philosopher wants to eat, they lock their own mutex, they non-blockingly try to take a combination of two spoons, retries for all possible combination of two spoons they can reach.
00:10:32 <b_jonas> if they succeed taking the spoons, then they unlock their own mutex. if they fail, then they wait on their own condvar unlocking the mutex. right after a philosopher puts a spoon down, they post the condvar of every other philosopher who can reach that spoon.
00:10:45 <fizzie> There seems to also be some odd/even floor bias in the current algorithm.
00:11:10 <b_jonas> in addition to this, you also need a livelock-avoiding strategy, sort of like for the ordinary dining philosophers.
00:11:36 <fizzie> Unfortunately for some reason they have not seen fit to put the elevator scheduler in our source control system so that people could send patches.
00:12:02 <ais523> b_jonas: the mutex is to prevent them being told that the spoons are now available until they've started their wait?
00:12:27 <b_jonas> ais523: yes
00:12:29 <ais523> I think that works if you have an atomic unlock-mutex-and-wait-on-condvar instruction
00:12:40 <b_jonas> ais523: you always have that for a condvar
00:12:58 <ais523> fizzie: they probably don't own it
00:12:59 <b_jonas> there's not much sense to have a condvar without that, except if you only have cooperative threads without a scheduler or parallelism
00:13:49 <b_jonas> fizzie: can you at least get a copy of the installed binary?
00:13:50 <ais523> I think the main downside of this solution, although it's probably unavoidable, is that each philosopher has to be aware of which other philosophers might want the same spoons
00:14:24 <zzo38> I think you can have, the numbers 0 to 9, and also <positive-enter>, <negative-enter>, <cancel>, <open>, and <close>, and then is good. (You can push <negative-enter> for the basement.) (And on outside, add a car call button.)
00:14:25 <b_jonas> ais523: yeah... that could be written on the spoons of course
00:14:28 <fizzie> They could ask the lift company to provide an API, at least. Though maybe there's some regulation in the industry?
00:15:18 <fizzie> We're building our own building next door, maybe it can have a proper Google lift.
00:15:19 <b_jonas> fizzie: but if you could submit new versions, who would verify those?
00:16:08 <b_jonas> who would verify that the control isn't malicious, such as making your boss get stuck in the elevator unless he agrees to give you a raise, or making the elevator come slowly when your boss calls it unless he gives you a raise?
00:16:26 <zzo38> Unless you are going to build your own lift, nobody will verify it, I think.
00:16:54 <b_jonas> fizzie: could you just put a wrapper over the buttons it has, so that it is always called to only one stop, thus directly control all its movements?
00:17:09 <zzo38> (And then they will not use the code, but if you build your own then you can use it.)
00:17:13 <b_jonas> always called to only one floor I mean
00:17:55 <fizzie> That might be a little hard to do effectively, since it's just one control panel but 5 lifts.
00:18:07 <b_jonas> oh... right
00:18:10 <b_jonas> yeah, that'd be tricky
00:19:02 <fizzie> Possibly it would be possible to enter the right sequence of inputs for any desired control outcome.
00:19:15 <fizzie> We'll put DeepMind on it.
00:19:26 <b_jonas> ouch
00:20:28 <fizzie> They'll build a ML model that nobody understands, but which gets people to their destinations 40% faster.
00:20:42 <b_jonas> although that would make it more easy to write control code that's plasibly deniably malicious
00:21:08 <b_jonas> hehe
00:21:10 <ais523> the only use for strong AI here would likely be in predicting which floors people will need when they haven't even arrived at the control panel yet
00:21:26 <ais523> once you have the control panel inputs, you can likely just brute-force an optimal solution, the search space can't be that large
00:21:40 <b_jonas> my thermometer says that the max outdoor temperature it has seen since the last reset is 64 °C
00:22:07 <b_jonas> I find that hard to believe
00:22:45 <b_jonas> ais523: oh yeah, HHGG has such elevators
00:22:54 <b_jonas> prescient ones
00:24:15 <b_jonas> oh and while we're at books
00:24:29 <ais523> the lifts at my local train station appear to have some limited level of prescience based in; in particular, they seem to do uncommanded moves when a train is imminently about to arrive at the station
00:24:42 <b_jonas> fizzie: Michael Ende describes a scene where a person forgets to get out of an elevator because they're reading an interesting book
00:24:49 <b_jonas> so that's a different way how that can happen
00:26:28 <b_jonas> ais523: I think in a place like Google, you could also have the software allow people to enter the floor number on their mobile phone, before they reach the control panel
00:27:03 <b_jonas> and then fizzie would have that automated from people's calendars, so that when you go to the elevator, it assumes you're going to the floor where your next meeting is scheduled to
00:29:34 <ais523> now I'm imagining putting desks and computers /inside/ the elevators so that people can work as they're going to meetings
00:29:48 <ais523> and just automatically end up in the right place at the right time
00:29:53 <ais523> I know it doesn't work logistically, though
00:30:28 <zzo38> How big is in the inside of the elevator?
00:31:06 <b_jonas> ais523: or people sitting in cubicles that run on wheels that run on rails, and whenever a group people have to meet, their cubicles move close to each other
00:32:37 <b_jonas> zzo38: usually between 4 to 18 square meters, usually smaller, larger if it's used to transport cargo or bed-ridden patients
00:32:37 <ais523> apparently some warehouses nowadays have robots that move the shelves to the people who put items on or take items off; the robots aren't accurate at manipulating items on the shelves, but moving the entire structure is much easier, and it can be parallelised so it's faster than having the workers move to the shelves
00:33:04 <b_jonas> heh
00:34:17 <b_jonas> how would my hon. and learned friend fungot design elevators?
00:34:17 <fungot> b_jonas: mr president, in this context, there are important issues at the same time they turned a blind eye to crimes committed on a daily basis means that they have when they board an aircraft and go from airports surrounded by the two committees and this is my third point is to persuade those responsible for these subjective descriptions and to ask them to amend it again during this plenary.
00:34:23 <fizzie> I read (/watched) something about a dock, which has a mixture of human-controlled mobile cranes for the slightly more complicated business, and fully autonomous ones that do the boring part of reshuffling containers in the yard.
00:35:21 <fizzie> I think they mentioned they had to program in a slowly cycling offset, because otherwise the robotic cranes were too accurate, always dropping the containers at exactly the same position, so the ground paving at the container corners/edges was wearing off much faster.
00:35:23 <b_jonas> I should try to use python
00:35:36 <fizzie> (Previously there was always enough slop to spread the impact.)
00:35:43 <b_jonas> hehe
00:36:20 <b_jonas> this sounds believable
00:38:33 <zzo38> If you have your own NNTP server, will you use the SUBSCRIBE command in my NNTP server if I implement it to send copies to your server too (when it is scheduled to do so)?
00:42:03 <b_jonas> ais523: wait, for what I said to work, if a philosopher locks a spoon but fails to lock the second spoon to it so unlocks the first spoon, then too they have to post the condvar of the other philosophers of that spoon
00:42:30 <b_jonas> no wait
00:42:35 <b_jonas> maybe the whole thing doesn't work
00:43:05 <b_jonas> when there's exactly one spoon free, how do the two philosophers avoid livelocking by alternatingly taking it in rapid succession?
00:43:16 <ais523> you'd need an atomic way to take two locks at once
00:43:29 <b_jonas> I mean obviously there can't be exactly one spoon free
00:43:34 <b_jonas> but something similar could happen
00:43:47 <ais523> there can locally be exactly one spoon free
00:43:51 <ais523> even if globally there are more
00:44:15 <b_jonas> yep
00:44:16 <ais523> that's not really a livelock, it's a failure mode that ends up degenerating to polling, which is a bit different
00:44:40 <b_jonas> hmm
00:44:46 <b_jonas> well, this is an interesting problem
00:45:02 <b_jonas> I think there is probably a solution without a global lock
00:45:22 <b_jonas> at least for large enough and sparse enough graphs; for just a dodecahedron it might not be worth
00:45:26 <zzo38> Is there a way to take two locks at once?
00:46:21 <ais523> b_jonas: I'm interested in a case that's generalized in several directions and is probably unsolvable, this was a subproblem of that that's interesting in its own right and will probably need solving first
00:46:30 -!- arseniiv has quit (Ping timeout: 258 seconds).
00:46:39 <zzo38> LLVM has a "atomicrmw" which can make some kind of atomic operations; would it do?
00:47:12 <ais523> zzo38: I've seen languages with a primitive for taking two locks at once
00:47:27 <ais523> a single atomicrmw can't do that, a double atomicrmw could but I don't know if LLVM has those
00:47:40 <ais523> (the hardware instruction backing it would be double-compare-and-swap which some CPUs have but most don't)
00:47:41 <zzo38> I think it might not, since you can't compare at the same time as the other operation
00:48:51 -!- Sgeo_ has joined.
00:51:39 <zzo38> As far as I can tell, LLVM does not have a double atomicrmw. It does have cmpxchg, though.
00:51:43 -!- Sgeo__ has quit (Ping timeout: 245 seconds).
00:56:20 -!- ais523 has quit (Quit: quit).
01:31:32 <zzo38> I think into the bit manipulation extension for RISC-V they should add the MOR operation from MMIX and the Muxcomp operation from the esolang wiki.
01:33:01 <shachaf> Do you like MXOR?
01:34:01 <zzo38> MXOR could also do maybe, in addition to MOR
01:35:18 -!- sebbu3 has joined.
01:39:13 -!- oerjan has joined.
01:39:17 -!- Hooloovo0 has quit (Excess Flood).
01:39:20 -!- sebbu has quit (Ping timeout: 258 seconds).
01:39:21 <int-e> MXOR = PCLMULQDQ, right?
01:40:14 <zzo38> I don't know what PCLMULQDQ means
01:40:59 <int-e> packed carry-less multiplication (quad word to double quad word)
01:47:26 -!- Hooloovo0 has joined.
01:54:35 <orin> idea
01:56:02 <oerjan> @metar ENVA
01:56:03 <lambdabot> ENVA 250150Z 34006KT 9999 SCT024 BKN038 08/04 Q1009 RMK WIND 670FT 32008KT
01:56:14 <oerjan> humid
01:56:34 <orin> use binary coded decimal as a basis for a character encoding
01:57:02 <orin> where two decimal digits are encoded per byte as in BCD
01:57:35 <orin> but then any pattern that is invalid is used for other characters
01:58:58 <orin> so basically that would be in hex, [0-F][A-F] and [A-F][0-9], or 6*16+6*10
01:59:24 <shachaf> int-e: Hmm, is it?
01:59:41 <orin> 156 bit pattern are invalid in BCD
02:00:13 <orin> oh wait I could have just subtracted 100 from 256
02:00:25 <zzo38> Some patterns might be used in case there is only one digit in one cell, maybe
02:01:00 <orin> hmm, how did BCD handle that normally?
02:03:08 <zzo38> I think different implementations has done a few different things
02:04:47 <zzo38> Wikipedia says that telephone BCD uses a bit pattern 1 1 1 1 for padding
02:10:11 <oerjan> `? linear logic
02:10:14 <HackEso> linear logic? ¯\(°​_o)/¯
02:43:00 -!- FreeFull has quit.
02:57:30 -!- adu has joined.
03:21:40 <b_jonas> int-e: no
03:47:58 -!- sprocklem has quit (Read error: Connection reset by peer).
03:48:05 -!- sprock1em has joined.
03:52:07 <zzo38> Would you be able to review my sqlnetnews code to see if anything you think is wrong with it?
04:36:12 <esowiki> [[Talk:Bitch]] M https://esolangs.org/w/index.php?diff=62565&oldid=62554 * A * (+110) /* Sketch: A Turing Machine */
05:19:18 <esowiki> [[English]] M https://esolangs.org/w/index.php?diff=62566&oldid=58334 * A * (+417) I believe that there are a shorter programs.
05:22:13 -!- Hooloovo0 has quit (Excess Flood).
05:22:49 -!- rickbutton has joined.
05:24:16 <esowiki> [[English]] M https://esolangs.org/w/index.php?diff=62567&oldid=62566 * A * (+152) Bootstrap
05:25:09 <esowiki> [[English]] M https://esolangs.org/w/index.php?diff=62568&oldid=62567 * A * (+29) /* 99 Bottles of Beer */
05:26:21 <esowiki> [[English]] M https://esolangs.org/w/index.php?diff=62569&oldid=62568 * A * (-5) /* 99 Bottles of Beer */
05:31:24 -!- Hooloovo0 has joined.
05:34:29 <esowiki> [[EsoInterpreters]] M https://esolangs.org/w/index.php?diff=62570&oldid=62314 * A * (+35) I almost forgot; bitch can simulate a UTM.
05:37:47 <esowiki> [[Talk:Bitch]] M https://esolangs.org/w/index.php?diff=62571&oldid=62565 * A * (+402) To make bootstrapping possible, you have to compile bitch first.
05:38:13 <esowiki> [[Talk:Bitch]] M https://esolangs.org/w/index.php?diff=62572&oldid=62571 * A * (+1) /* Incapability of bitch implementing Popular problems */
05:41:12 <esowiki> [[Talk:Bitch]] M https://esolangs.org/w/index.php?diff=62573&oldid=62572 * A * (+193) /* Incapability of bitch implementing Popular problems */
05:44:51 <esowiki> [[Talk:Bitch]] M https://esolangs.org/w/index.php?diff=62574&oldid=62573 * A * (+228) /* Sketch: A Turing Machine */
05:48:21 <esowiki> [[Talk:Bitch]] M https://esolangs.org/w/index.php?diff=62575&oldid=62574 * A * (+163) I still don't know the answer.
05:50:28 <esowiki> [[Talk:Bitch]] M https://esolangs.org/w/index.php?diff=62576&oldid=62575 * A * (+59) /* Sketch: A Turing Machine */
05:55:09 <esowiki> [[Talk:Bitch]] M https://esolangs.org/w/index.php?diff=62577&oldid=62576 * A * (-4) Too much indentation
06:03:08 <esowiki> [[User talk:A]] M https://esolangs.org/w/index.php?diff=62578&oldid=62558 * A * (-843)
06:04:05 <esowiki> [[User:A]] M https://esolangs.org/w/index.php?diff=62579&oldid=62530 * A * (+841)
06:04:25 <esowiki> [[User:A]] M https://esolangs.org/w/index.php?diff=62580&oldid=62579 * A * (+13) /* Please do not create alternate accounts to make a point */
06:14:36 <esowiki> [[User:A]] M https://esolangs.org/w/index.php?diff=62581&oldid=62580 * A * (+302)
06:16:19 <esowiki> [[User:A]] M https://esolangs.org/w/index.php?diff=62582&oldid=62581 * A * (-209)
06:22:20 <esowiki> [[User:A]] M https://esolangs.org/w/index.php?diff=62583&oldid=62582 * A * (+57)
06:27:08 -!- oerjan has quit (Quit: leaving).
06:29:12 <esowiki> [[User:A]] M https://esolangs.org/w/index.php?diff=62584&oldid=62583 * A * (+1507) Add another log with my username in it
06:47:45 <esowiki> [[User:A]] M https://esolangs.org/w/index.php?diff=62585&oldid=62584 * A * (+756)
07:05:10 -!- AnotherTest has joined.
07:17:04 <zzo38> Wikipedia mentions such thing as synonym, homonym, heteronym, etc, but what is it called if a word has the same spelling and meaning and pronounce but the etymology is different?
07:17:55 <esowiki> [[User:A]] https://esolangs.org/w/index.php?diff=62586&oldid=62585 * A * (-815)
07:18:15 <zzo38> They even mention what it is called if the capitalization is different, too
07:21:15 <esowiki> [[User:A]] M https://esolangs.org/w/index.php?diff=62587&oldid=62586 * A * (+649)
08:37:26 -!- LKoen has joined.
08:38:14 <esowiki> [[Talk:Bitch]] https://esolangs.org/w/index.php?diff=62588&oldid=62577 * Salpynx * (+169) /* Sketch: A Turing Machine */ D'oh, oh dear....
08:49:39 -!- ais523 has joined.
09:06:28 <b_jonas> wait what?
09:06:46 <b_jonas> http://www.ioccc.org/2019/whowon.html 2019-05-11 The winners of the 26th IOCCC have been announced.
09:06:51 <b_jonas> I totally missed this because of the vacation
09:06:55 <b_jonas> has this been listed? let me check the logs
09:07:16 <b_jonas> `ioccclist http://www.ioccc.org/2019/whowon.html 2019-05-11 The winners of the 26th IOCCC have been announced.
09:07:17 <HackEso> ioccclist http://www.ioccc.org/2019/whowon.html 2019-05-11 The winners of the 26th IOCCC have been announced.: b_jonas
09:08:56 <b_jonas> wow, these sound interesting
09:10:03 <b_jonas> it doesn't look like it's even been mentioned on the channel, wtf
09:10:24 <b_jonas> there's no "best of show" for some reason
09:19:19 -!- ais523 has quit (Remote host closed the connection).
09:20:32 -!- ais523 has joined.
10:06:10 <b_jonas> also, they say that "We plan to publish source and annotations close to June 2nd."
10:08:10 <b_jonas> `? defenestration
10:08:11 <b_jonas> `? decapitation
10:08:12 <HackEso> Defenestration is the traditional Czech system for voting out government officials.
10:08:13 <HackEso> decapitation? ¯\(°​_o)/¯
10:08:25 -!- Lord_of_Life has quit (Ping timeout: 246 seconds).
10:08:25 <b_jonas> Decapitation is the traditional French system for voting out government officials.
10:10:54 <b_jonas> `? spoiler
10:10:55 <HackEso> spoiler? ¯\(°​_o)/¯
10:10:56 <b_jonas> `? spoil
10:10:57 <HackEso> spoil? ¯\(°​_o)/¯
10:11:49 -!- Lord_of_Life has joined.
10:13:12 -!- LKoen has quit (Remote host closed the connection).
10:21:04 <b_jonas> `? womb
10:21:05 <HackEso> womb? ¯\(°​_o)/¯
10:31:14 -!- LKoen has joined.
10:35:16 <esowiki> [[Talk:Bitch]] https://esolangs.org/w/index.php?diff=62589&oldid=62588 * Salpynx * (+980) /* Incapability of bitch implementing Popular blah */
10:41:43 -!- rodgort has quit (Quit: Leaving).
10:47:25 -!- john_metcalf has joined.
10:47:50 <b_jonas> I wonder, what is the lowest natural number such that no pokemon has exactly that many eyes
10:51:02 -!- rodgort has joined.
11:19:05 -!- LKoen has quit (Remote host closed the connection).
11:23:02 -!- LKoen has joined.
11:24:17 <b_jonas> hmm, http://www.madore.org/~david/programs/simple/simple.html is a language that might not be esoteric, but is named of a joke esoteric language
11:31:53 -!- Sgeo_ has quit (Read error: Connection reset by peer).
11:32:16 -!- Sgeo_ has joined.
11:51:15 <esowiki> [[Finite looping automaton]] https://esolangs.org/w/index.php?diff=62590&oldid=62557 * Salpynx * (+74) Remove erroneous claims
11:57:11 <esowiki> [[Finite looping automaton]] M https://esolangs.org/w/index.php?diff=62591&oldid=62590 * A * (+52) Modify misleading comment.
11:57:24 <esowiki> [[Finite looping automaton]] M https://esolangs.org/w/index.php?diff=62592&oldid=62591 * A * (-28) /* Example programs */
11:57:59 <esowiki> [[Finite looping automaton]] M https://esolangs.org/w/index.php?diff=62593&oldid=62592 * A * (+0)
12:00:21 <esowiki> [[Finite looping automaton]] M https://esolangs.org/w/index.php?diff=62594&oldid=62593 * A * (+212)
12:00:35 <esowiki> [[Finite looping automaton]] M https://esolangs.org/w/index.php?diff=62595&oldid=62594 * A * (+0)
12:03:37 <esowiki> [[Talk:Bitch]] M https://esolangs.org/w/index.php?diff=62596&oldid=62589 * A * (-434) Nobody answered; I will just leave that out. This is acceptible, right?
12:05:37 <esowiki> [[Finite looping automaton]] M https://esolangs.org/w/index.php?diff=62597&oldid=62595 * A * (+30) /* Looping counter */
12:06:32 <esowiki> [[Finite looping automaton]] M https://esolangs.org/w/index.php?diff=62598&oldid=62597 * A * (-29)
12:09:28 <esowiki> [[Finite looping automaton]] M https://esolangs.org/w/index.php?diff=62599&oldid=62598 * A * (+7) /* Syntax */
12:09:41 <esowiki> [[Finite looping automaton]] M https://esolangs.org/w/index.php?diff=62600&oldid=62599 * A * (+1) /* Syntax */
12:10:11 -!- arseniiv has joined.
12:10:22 <esowiki> [[Finite looping automaton]] M https://esolangs.org/w/index.php?diff=62601&oldid=62600 * A * (+5) /* Infinite loop */
12:11:12 <esowiki> [[Talk:Bitch]] M https://esolangs.org/w/index.php?diff=62602&oldid=62596 * A * (+62) /* Sketch: A Turing Machine */
12:14:15 <esowiki> [[Talk:Bitch]] M https://esolangs.org/w/index.php?diff=62603&oldid=62602 * A * (+170) /* Sketch: A Turing Machine */
12:17:06 <esowiki> [[Talk:Bitch]] M https://esolangs.org/w/index.php?diff=62604&oldid=62603 * A * (+83) /* Sketch: A Turing Machine */
12:17:55 <esowiki> [[Talk:Bitch]] M https://esolangs.org/w/index.php?diff=62605&oldid=62604 * A * (+0) /* Sketch: A Turing Machine */
12:21:47 <esowiki> [[Talk:Bitch]] M https://esolangs.org/w/index.php?diff=62606&oldid=62605 * A * (-606) int-e typed i instead of l.
12:26:09 <esowiki> [[Talk:Bitch]] M https://esolangs.org/w/index.php?diff=62607&oldid=62606 * A * (-2867)
12:33:44 <b_jonas> whoa, this language has esoteric semantics
12:37:31 <esowiki> [[User:A]] M https://esolangs.org/w/index.php?diff=62608&oldid=62587 * A * (+206)
12:47:15 <esowiki> [[Talk:Bitch]] M https://esolangs.org/w/index.php?diff=62609&oldid=62607 * Int-e * (+0) /* Sketch: A Turing Machine */ wtf, "I" is a pronoun!
12:47:57 <esowiki> [[User:A]] M https://esolangs.org/w/index.php?diff=62610&oldid=62608 * A * (-842) /* Please do not create alternate accounts to make a point */
12:49:07 <int-e> . o O ( Just when I thought A was becoming more reasonable over time. )
12:59:46 <esowiki> [[Talk:Bitch]] https://esolangs.org/w/index.php?diff=62611&oldid=62609 * Int-e * (+93) /* Sketch: A Turing Machine */ add a clarification so that the discussion that A deleted (please don't do that, especially when other people were involved!) was not in vain.
13:02:10 <esowiki> [[Finite looping automaton]] M https://esolangs.org/w/index.php?diff=62612&oldid=62601 * A * (+37) /* Syntax */
13:10:14 -!- Phantom_Hoover has joined.
13:18:51 -!- FreeFull has joined.
13:25:33 -!- ais523 has quit (Quit: quit).
13:31:22 -!- sebbu3 has changed nick to sebbu.
14:15:32 -!- LKoen has quit (Remote host closed the connection).
14:30:22 <esowiki> [[User talk:A]] https://esolangs.org/w/index.php?diff=62613&oldid=62578 * Salpynx * (+757)
14:39:05 -!- LKoen has joined.
15:16:20 -!- sleepnap has joined.
15:23:36 <esowiki> [[User talk:A]] M https://esolangs.org/w/index.php?diff=62614&oldid=62613 * A * (-757) Great, I will use this message to make my user page ridiculous.
15:23:47 <esowiki> [[User:A]] M https://esolangs.org/w/index.php?diff=62615&oldid=62610 * A * (+756)
15:32:38 -!- b_jonas has quit (Ping timeout: 272 seconds).
15:33:09 -!- b_jonas has joined.
15:38:17 <int-e> So A's reading the IRC logs. Great.
15:40:09 -!- arseniiv_ has joined.
15:40:09 -!- arseniiv has quit (Read error: Connection reset by peer).
15:42:31 <arseniiv_> int-e: we’re famous, our names are forever on A’s page! Oh well, not forever, just until the next blanking, what a shame
15:42:37 -!- arseniiv_ has changed nick to arseniiv.
15:54:48 -!- b_jonas has quit (Ping timeout: 272 seconds).
15:55:26 -!- sftp has quit (Ping timeout: 272 seconds).
15:56:18 -!- b_jonas_ has joined.
16:00:31 -!- sftp has joined.
16:20:05 -!- sebbu2 has joined.
16:20:47 -!- sebbu has quit (Ping timeout: 248 seconds).
16:27:21 -!- sleepnap has quit (Quit: Leaving.).
17:15:53 -!- Sgeo_ has quit (Read error: Connection reset by peer).
17:16:20 -!- Sgeo_ has joined.
17:33:22 -!- LKoen has quit (Remote host closed the connection).
17:39:31 <zzo38> Why does the Telus television try to keep track of the current playback state in the remote control?
17:40:51 -!- LKoen has joined.
18:05:06 <esowiki> [[Talk:Volatile]] N https://esolangs.org/w/index.php?oldid=62616 * TuxCrafting * (+712) Created page with "== Possibly Turing-complete? == There is a way to push 1, <code>~:/</code> (well, a non-deterministic way, but the chance for it to fail is very low in practice), and so ther..."
18:14:18 -!- Sgeo__ has joined.
18:17:55 -!- Sgeo_ has quit (Ping timeout: 268 seconds).
18:20:36 -!- Phantom_Hoover has quit (Ping timeout: 258 seconds).
18:30:01 <b_jonas_> Is there a creature (presumably an artifact creature) that has reverse wither, that is, damage dealt to it acts as wither damage, or perhaps damage dealt to it removes that many +1/+1 counters from it?
18:30:05 -!- b_jonas_ has changed nick to b_jonas.
18:31:57 <b_jonas> sort of
18:32:03 <b_jonas> `card-by-name sekki, seasons
18:32:05 <HackEso> Sekki, Seasons' Guide \ 5GGG \ Legendary Creature -- Spirit \ 0/0 \ Sekki, Seasons' Guide enters the battlefield with eight +1/+1 counters on it. \ If damage would be dealt to Sekki, prevent that damage, remove that many +1/+1 counters from Sekki, and create that many 1/1 colorless Spirit creature tokens. \ Sacrifice eight Spirits: Return Sekki from your graveyard to the battlefield. \ SOK-R
18:32:12 <b_jonas> no wait
18:32:19 <b_jonas> that's like a hydra too, adding +1/+1 counters
18:32:35 <b_jonas> found it
18:32:40 <b_jonas> it's Ugin's Conjurant
18:48:28 -!- sebbu2 has changed nick to sebbu.
18:49:10 <b_jonas> wtf
18:49:33 <b_jonas> why is the text box of Goatnap slanted?
18:51:17 <b_jonas> ah it's not
18:51:24 <b_jonas> it's just a scanning error in scryfall
18:53:08 <b_jonas> or not, who knows
19:05:44 <zzo38> If I write a NNTP client software, what do you suggest I will call it?
19:07:01 <zzo38> b_jonas: To your question about how many eyes a pokemon has, my brother suggested five but is unsure.
19:17:40 <b_jonas> I see
19:21:08 <zzo38> One idea of Magic: the Gathering card: {?} Enchantment - Aura ;; Enchant damageable ;; At the beginning of each upkeep, ~ deals 1 damage to enchanted damageable. ;; Lifelink
19:32:52 <b_jonas> zzo38: what's a damageable
19:33:40 <b_jonas> also, they're reprinting Snow-covered Plains, though it's not clear to me in what number of copies
19:35:18 <zzo38> A damageable is a player, planeswalker, or creature, just as though instead of "any target" it says "target damageable" (I don't like "any target", and also, "damageable" is no longer limited to "target"; it means the same thing)
19:35:46 <b_jonas> I see
19:36:25 <b_jonas> well, that looks interesting, because it could be blue or black
19:36:28 <b_jonas> wait
19:36:34 <b_jonas> it has lifelink? then I'm not sure it can be blue
19:36:37 <b_jonas> drat
19:36:49 <b_jonas> it would be more interesting if it could somehow be done in blue
19:37:16 <b_jonas> well, it could work well in black
19:38:19 <zzo38> It could be altered as needed, I suppose
19:46:32 -!- arseniiv has quit (Ping timeout: 258 seconds).
20:09:23 -!- LKoen has quit (Remote host closed the connection).
20:40:07 -!- mniip has quit (Quit: This page is intentionally left blank.).
20:41:40 -!- mniip has joined.
20:43:41 <b_jonas> `?
20:43:42 <HackEso> ​ ? ¯\(°​_o)/¯
20:43:46 <b_jonas> `wisdom
20:43:46 <HackEso> 10//10 = 10 in every base.
20:43:47 <b_jonas> `quote
20:43:47 <HackEso> 566) (Of Minecraft:) <elliott> So basically I didn't understand what it was at all, I thought maybe you were meant to be like a worm and just sort of wriggle about underground.
20:44:04 <b_jonas> `wisdom
20:44:06 <HackEso> madness//madness lies thataway.
20:44:09 <b_jonas> `quote
20:44:10 <HackEso> 194) <oklopol> oerjan: also actually A(4, 4) is larger than any other integer, i learned this the other day when i was reading about this algo, it had complexity O(n a^-1(n)) = O(n a^-1(4))
20:44:11 <b_jonas> `recipe
20:44:11 <HackEso> ​ via Meal-Master (tm) v8.05 \ \ Title: CHICKEN BEANS MUFFINS \ Categories: Salads, Chicken, Sauces \ Yield: 8 Servings \ \ 1 tb Fresh lemon juice \ 1/4 ts Pepper, or dough \ 1/4 ts Salt \ 2 ea Garlic cloves, peeled, cooked, thinly \ -- sliced \ 1 c Flour \ 1/2 c Margarine; melted \ Beer -- chopped \ Pepper, seeded and \ -- chopped \ \ Serve with whipped cream ends of honey. Nutrition of each, peaches \ \ MMMMM \ \ MMMMM----- Reci
21:09:34 -!- AnotherTest has quit (Ping timeout: 272 seconds).
21:31:41 <zzo38> Do you ave a suggestion of a name of a NNTP client software? (I can provide details if requested)
21:32:55 <b_jonas> zzo38: "Nûwsreader", because it's a character name in http://www.darthsanddroids.net/episodes/1765.html ?
21:33:08 <b_jonas> or is that too much of an in-joke?
21:34:31 <b_jonas> or Bystander, who is the character in the bobadventures webcomic who reads newspaper the most often -- either him or Bob himself, I'm not sure
21:35:34 <b_jonas> or Bob because he's the one who sells the newspapers to readers, analogously to how your software gives the news to its users -- except that's no good, there's already a software called Microsoft Bob
21:36:20 <zzo38> It isn't too much of an in-joke, but contains non-ASCII characters and may be too similar to "newsreader"
21:43:06 -!- Phantom_Hoover has joined.
21:45:55 -!- Illfit_Rorq has joined.
21:46:44 -!- Illfit_Rorq has quit (Client Quit).
21:47:31 <zzo38> Maybe "bystand" will do; no program by that name can be found in any package on my computer
21:47:49 -!- moei has quit (Quit: Leaving...).
22:04:43 <b_jonas> `? sound
22:04:44 <HackEso> sound? ¯\(°​_o)/¯
22:07:30 -!- Lord_of_Life_ has joined.
22:11:01 -!- Lord_of_Life has quit (Ping timeout: 268 seconds).
22:11:02 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
22:12:54 <b_jonas> `? syrup
22:12:55 <HackEso> syrup? ¯\(°​_o)/¯
22:12:56 <b_jonas> `? stirrup
22:12:57 <HackEso> stirrup? ¯\(°​_o)/¯
22:29:52 <b_jonas> `? dog
22:29:53 <HackEso> dog? ¯\(°​_o)/¯
22:32:42 <b_jonas> `? light
22:32:43 <HackEso> light? ¯\(°​_o)/¯
22:42:12 <b_jonas> `? kmc
22:42:13 <HackEso> kmc did not run the International Devious Code Contest of 2013.
22:54:49 -!- unlimiter has joined.
22:55:46 -!- unlimiter has quit (Client Quit).
23:31:32 -!- Phantom_Hoover has quit (Read error: Connection reset by peer).
23:43:52 <esowiki> [[User:Timtomtoaster]] https://esolangs.org/w/index.php?diff=62617&oldid=60181 * Orangeyy * (+0)
23:45:21 <zzo38> What is the correct way to receive a line from a socket? Should MSG_PEEK be used?
23:58:51 -!- john_metcalf has quit (Ping timeout: 244 seconds).
←2019-05-24 2019-05-25 2019-05-26→ ↑2019 ↑all