Editing Talk:2659: Unreliable Connection

Jump to: navigation, search
Ambox notice.png Please sign your posts with ~~~~

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 1: Line 1:
 
<!--Please sign your posts with ~~~~ and don't delete this text. New comments should be added at the bottom.-->
 
<!--Please sign your posts with ~~~~ and don't delete this text. New comments should be added at the bottom.-->
 +
 
I don’t think this has anything to do with teleconferencing. Am I missing something? [[Special:Contributions/172.70.214.81|172.70.214.81]] 22:46, 15 August 2022 (UTC)
 
I don’t think this has anything to do with teleconferencing. Am I missing something? [[Special:Contributions/172.70.214.81|172.70.214.81]] 22:46, 15 August 2022 (UTC)
 
:Yes. The impliction is that people are expecting you to be available for online communications, and you can use the unreliable Internet connection as an excuse to get out of it. [[User:Barmar|Barmar]] ([[User talk:Barmar|talk]]) 22:51, 15 August 2022 (UTC)
 
:Yes. The impliction is that people are expecting you to be available for online communications, and you can use the unreliable Internet connection as an excuse to get out of it. [[User:Barmar|Barmar]] ([[User talk:Barmar|talk]]) 22:51, 15 August 2022 (UTC)
Line 12: Line 13:
 
::Too early in the morning for me to untangle. The only thing I'm sure about is your division by 2^11 (how many total paths there are to get down). [[Special:Contributions/172.70.91.78|172.70.91.78]] 05:00, 16 August 2022 (UTC)
 
::Too early in the morning for me to untangle. The only thing I'm sure about is your division by 2^11 (how many total paths there are to get down). [[Special:Contributions/172.70.91.78|172.70.91.78]] 05:00, 16 August 2022 (UTC)
 
:::Me again. I hadn't checked that the transcript (which said it was switch #8) was correct. Have now, and found it to be wrong. Have hence also just corrected the Transcript. So I'm gonna assume your 11-choose-3 is entirely correct after all. ;) [[Special:Contributions/172.70.91.78|172.70.91.78]] 05:08, 16 August 2022 (UTC)
 
:::Me again. I hadn't checked that the transcript (which said it was switch #8) was correct. Have now, and found it to be wrong. Have hence also just corrected the Transcript. So I'm gonna assume your 11-choose-3 is entirely correct after all. ;) [[Special:Contributions/172.70.91.78|172.70.91.78]] 05:08, 16 August 2022 (UTC)
:It's actually 12 switches, not 11, but that doesn't affect the math too much. I originally thought "off" was switch 10, which would have changed the math (to 3%), but that's just the one the current ball hit. The actual "off" switch is switch 9. [[User:N0lqu|-boB]] ([[User talk:N0lqu|talk]])
 
::It previously said that there were eleven "on" switches and one "off" switch (which is twelve in total, but it didn't add them up explicitly), and the change to say that there are 12 Ons and 1 Off made it wrong. I corrected/rephrased it (see if you agree with however it looks by the time you get around to reading this) to avoid that reading error (one which happened to me with my own first glance at the phrasing used, but I thought that was just me at the time) without adding any new misinterpretation or easy misinterpretationality.
 
::The maths above is indeed correct enough. The 2^11 relates to the total number of unique paths it can take (assuming a bounce left/right just enough to strike the nearest offset pin below to force a new left/right bounce choice) from the first divider through to any of the 11 final left-right pin-bounces (and onto the 12 switches, at which point we're not bothered with the bouncing - diagram suggests the balls leap outwards and don't hit any other switches).
 
::"11 choose 3" is a way how to ask, given 11 items (possible bounces), how many unique and unordered combinations of exactly 3 of these must exist (leftward-bounces, the rest being right-bounces) to filter onto the off-connected switch. (This is the same as "11 choose 8", if you decide to ask how many right-bounces are necessary, the rest being left-bounces.) That could be layer 1 (the 1-pin), 2 (the 2-pins) and 3 (...), before going consistently right to the final strike of the switch, or layers 9+10+11 (after being pure-right 1..8), but with many intermediate tracks across the pin-spacs (165 in total, as it happens; and it would be 55 to hit switch 10. Or 2, instead of 3, if you orientate things the other way round).
 
:: 165/2048 (paths hitting the off-switch (at #9) divided by all paths that might happen) is a tad over 8%. On the assumption that it's fair and unbiased and you don't get more rattling around than a simple (single half-step) left/right distribution. [[Special:Contributions/172.70.91.78|172.70.91.78]] 03:20, 19 August 2022 (UTC)
 
 
  
 
To whomever did [https://www.explainxkcd.com/wiki/index.php?title=2659:_Unreliable_Connection&diff=292862&oldid=292861], doesn't [https://drops.dagstuhl.de/opus/volltexte/2018/8817/pdf/LIPIcs-FUN-2018-26.pdf] prove that symmetrical configurations nearly identical to those shown can produce uniform distributions? They seem to show it's just a matter of horizontal pin spacing. However, I for one can not verify the proof, which uses unusual (novel?) non-Unicode math notation, and a fairly opaque method of proof. [[Special:Contributions/172.70.211.134|172.70.211.134]] 00:07, 16 August 2022 (UTC)
 
To whomever did [https://www.explainxkcd.com/wiki/index.php?title=2659:_Unreliable_Connection&diff=292862&oldid=292861], doesn't [https://drops.dagstuhl.de/opus/volltexte/2018/8817/pdf/LIPIcs-FUN-2018-26.pdf] prove that symmetrical configurations nearly identical to those shown can produce uniform distributions? They seem to show it's just a matter of horizontal pin spacing. However, I for one can not verify the proof, which uses unusual (novel?) non-Unicode math notation, and a fairly opaque method of proof. [[Special:Contributions/172.70.211.134|172.70.211.134]] 00:07, 16 August 2022 (UTC)
 
:Not sure, but [https://ja.wikipedia.org/wiki/%E9%87%98%E8%AA%BF%E6%95%B4 this Japanese Wikipedia article] is fascinating. [[Special:Contributions/172.70.206.213|172.70.206.213]] 01:51, 16 August 2022 (UTC)
 
:Not sure, but [https://ja.wikipedia.org/wiki/%E9%87%98%E8%AA%BF%E6%95%B4 this Japanese Wikipedia article] is fascinating. [[Special:Contributions/172.70.206.213|172.70.206.213]] 01:51, 16 August 2022 (UTC)
:Please see section 3.5 on pp. 16-18 of the currently first reference [https://arxiv.org/pdf/1601.05706.pdf]. I am particularly intrigued by, "Open Problem 2: Is every uniform distribution of output probabilities of the form 1/2<sup>k</sup> constructible by a 50-50 Pachinko?" on p. 18. However I haven't dived in enough to even know where the parentheses are supposed to be in that expression, yet. [[User:Liv2splain|Liv2splain]] ([[User talk:Liv2splain|talk]]) 17:27, 16 August 2022 (UTC)
+
:Please see section 3.5 on pp. 16-18 of the currently first reference [https://arxiv.org/pdf/1601.05706.pdf]. I am particularly intrigued by, "Open Problem 2: Is every uniform distribution of output probabilities of the form 1/2<sup>k</sup> constructible by a 50-50 Pachinko?" on p. 18. [[User:Liv2splain|Liv2splain]] ([[User talk:Liv2splain|talk]]) 17:27, 16 August 2022 (UTC)
: Good question! https://ibb.co/sRwGwB9 don't look triangular, but it seems the proof might suggest much more triangular solutions. Worth thinking about! [[Special:Contributions/172.69.33.115|172.69.33.115]] 21:24, 16 August 2022 (UTC)
 
  
 
What is the chance that the ball will bounce off the first pin, go down the outside of the pins and miss all the switches?
 
What is the chance that the ball will bounce off the first pin, go down the outside of the pins and miss all the switches?
Line 41: Line 35:
 
For real though, isn't this kind of a good idea?  [[User:Fephisto|Fephisto]] ([[User talk:Fephisto|talk]]) 14:34, 16 August 2022 (UTC)
 
For real though, isn't this kind of a good idea?  [[User:Fephisto|Fephisto]] ([[User talk:Fephisto|talk]]) 14:34, 16 August 2022 (UTC)
 
:Talk to edtech people in the {{w|MOOC}} space and they will tell you asynchronous is worth it, but talk to people who study educational quality factors like time to receive answers to unanticipated questions, and they will have different ideas. [[User:Liv2splain|Liv2splain]] ([[User talk:Liv2splain|talk]]) 14:44, 16 August 2022 (UTC)
 
:Talk to edtech people in the {{w|MOOC}} space and they will tell you asynchronous is worth it, but talk to people who study educational quality factors like time to receive answers to unanticipated questions, and they will have different ideas. [[User:Liv2splain|Liv2splain]] ([[User talk:Liv2splain|talk]]) 14:44, 16 August 2022 (UTC)
 
Does anyone have an openWRT (or other) implementation of this feature yet?
 
:You can induce it on stock firmware without reflashing, but you need to know the parameters like how often balls come out of the hopper, and what exactly the on/off switches do. As pseudocode:
 
::<tt>#!/bin/sh</tt>
 
::<tt>while true ; do</tt>
 
:::<tt>sleep </tt>''seconds''
 
:::<tt>if [ `rand100` -le 8 ] ; then</tt>
 
::::<tt>wifictrl off</tt>
 
:::<tt>else</tt>
 
::::<tt>wifictrl on</tt>
 
:::<tt>fi</tt>
 
::<tt>done</tt>
 
:[[Special:Contributions/172.70.214.81|172.70.214.81]] 00:38, 17 August 2022 (UTC)
 
 
There are spaces between the button that the balls can fall into, and this could complicate the stuff a bit. However if the ratio between probability of hitting ON and probability of hitting OFF remain the same (1883:165), the average OFF time will still be the same (165/2048 of the time). The behavior that the network is switching  between ON and OFF will probably be changed though.  [[User:Lamty101|Lamty101]] ([[User talk:Lamty101|talk]]) 04:44, 17 August 2022 (UTC)
 
 
I would have expected the negative reviews to have mentioned all the balls on the floor and perhaps the need to periodically refill the hopper. [[User:Philhower|Philhower]] ([[User talk:Philhower|talk]]) 16:18, 17 August 2022 (UTC)
 
:If it's a Pachinko machine instead of just a Galton board, then refilling the hopper is done automatically by robotics behind the back wall of the device. Someday remind me to tell you about the Japanese recession caused by out-of-work hopper refillers when that innovation was introduced. [[Special:Contributions/172.70.206.95|172.70.206.95]] 02:12, 31 August 2022 (UTC)
 
 
There is an online chat program called UC and it had stopped upgrading since 2012. Many people stopped using it probably due to its "unreliable connection". [[User:Unreliable Connection|2659: Unreliable Connection]] ([[User talk:Unreliable Connection|talk]]) 02:05, 13 April 2023 (UTC)
 

Please note that all contributions to explain xkcd may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see explain xkcd:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel | Editing help (opens in new window)

Template used on this page: