Editing Talk:2585: Rounding

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 71: Line 71:
 
:::And, assuming the sequence is chosen for maximising upwards, you've got the function at each stage that is selected precisely because ''for that exact state-value'' it is specifically upward-trending, so when you try that in a different context reversion-to-the-mean suggests you're perhaps more likely to hit one of the downward-trends in the relationship.
 
:::And, assuming the sequence is chosen for maximising upwards, you've got the function at each stage that is selected precisely because ''for that exact state-value'' it is specifically upward-trending, so when you try that in a different context reversion-to-the-mean suggests you're perhaps more likely to hit one of the downward-trends in the relationship.
 
:::My theory is that for any given starting value, some convert-then-round (from a sufficiently diverse choice of options) will always maximise the resulting magnitude. And that result will always have its own maximal conversion. Although those two operations may be less maximising in combination than a submaximal first operation (maybe, in some cases, a slight ''reduction''?) that 'lands' on a better number for a differing secondary maximiser step to act upon. So a full search-path needs to consider an N-step look-ahead method rooted in a breadth-first trial of each step-1, etc, to optimise the maximiser-optimiser process. But I haven't the time to test it right now. Maybe later! [[Special:Contributions/172.70.162.77|172.70.162.77]] 00:53, 25 February 2022 (UTC)
 
:::My theory is that for any given starting value, some convert-then-round (from a sufficiently diverse choice of options) will always maximise the resulting magnitude. And that result will always have its own maximal conversion. Although those two operations may be less maximising in combination than a submaximal first operation (maybe, in some cases, a slight ''reduction''?) that 'lands' on a better number for a differing secondary maximiser step to act upon. So a full search-path needs to consider an N-step look-ahead method rooted in a breadth-first trial of each step-1, etc, to optimise the maximiser-optimiser process. But I haven't the time to test it right now. Maybe later! [[Special:Contributions/172.70.162.77|172.70.162.77]] 00:53, 25 February 2022 (UTC)
::In fact, the starting value of 17 is most definitely optimal for these choices of units, assuming you want only one optimal choice of rounding (not having to choose between several equivalent values, and not end up non-rounding, like you get at 45 mph). A simple spreadsheet with the ablity to copy-paste an indefinite number of steps with error-checking is here: https://docs.google.com/spreadsheets/d/1ZUSbUmY2rz2JqJBfYIC2GQJucOJ71A0riTCm_OAE4VU/edit#gid=962607803 [[Special:Contributions/141.101.69.214|141.101.69.214]] 16:46, 9 March 2022 (UTC) 
 
  
 
A note about the propulsion system in the mouseover text: This system is not entirely novel and was first proposed by Douglas Adams who suggested using the notebooks of waiters in bistros to achieve the desired precision loss. He suggested it should be possible to achieve speeds of round ∞kph (∞mph) [[Special:Contributions/162.158.202.247|162.158.202.247]]
 
A note about the propulsion system in the mouseover text: This system is not entirely novel and was first proposed by Douglas Adams who suggested using the notebooks of waiters in bistros to achieve the desired precision loss. He suggested it should be possible to achieve speeds of round ∞kph (∞mph) [[Special:Contributions/162.158.202.247|162.158.202.247]]

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)

Templates used on this page: