Editing Talk:1580: Travel Ghost
![]() |
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 20: | Line 20: | ||
:Are you aware if such an app exists in real life? I'd be interested in trying to program one (albeit with less tangible ghosts). [[User:LowHangingFruit|LowHangingFruit]] 14:19, 22 September 2015 (UTC) | :Are you aware if such an app exists in real life? I'd be interested in trying to program one (albeit with less tangible ghosts). [[User:LowHangingFruit|LowHangingFruit]] 14:19, 22 September 2015 (UTC) | ||
:: This is an extremely easy algorithm to program (I have taught it while teaching AP (high school) computer science), however it isn't an algorithm that will likely be useful to you since it has exponential time complexity. In other words, if there are more than a trivial number of possibilities to be examined, finding the solution through this algorithm would not finish before you were dead. For those of you who are about to say that if we could run a huge bunch of these possibilities in parallel: merging the results, memory management, context switching, and similar things, even if they could be done in constant time would still mean a constant amount of time for each of an exponential set of possibilities. [[Special:Contributions/108.162.219.173|108.162.219.173]] 22:29, 22 September 2015 (UTC)tomb | :: This is an extremely easy algorithm to program (I have taught it while teaching AP (high school) computer science), however it isn't an algorithm that will likely be useful to you since it has exponential time complexity. In other words, if there are more than a trivial number of possibilities to be examined, finding the solution through this algorithm would not finish before you were dead. For those of you who are about to say that if we could run a huge bunch of these possibilities in parallel: merging the results, memory management, context switching, and similar things, even if they could be done in constant time would still mean a constant amount of time for each of an exponential set of possibilities. [[Special:Contributions/108.162.219.173|108.162.219.173]] 22:29, 22 September 2015 (UTC)tomb | ||
− | |||
− | |||
Will his children have half-siblings that are fathered by the ghost that has replaced him in the bedroom? Or are ghosts infertile?[[Special:Contributions/108.162.215.170|108.162.215.170]] 04:07, 22 September 2015 (UTC) | Will his children have half-siblings that are fathered by the ghost that has replaced him in the bedroom? Or are ghosts infertile?[[Special:Contributions/108.162.215.170|108.162.215.170]] 04:07, 22 September 2015 (UTC) | ||
Line 28: | Line 26: | ||
[[Special:Contributions/162.158.90.249|162.158.90.249]] 11:57, 22 September 2015 (UTC) | [[Special:Contributions/162.158.90.249|162.158.90.249]] 11:57, 22 September 2015 (UTC) | ||
:Not really - or at least not real. There may be some "potential photons" in some attempts to describe some quantum-based theory ... but there will certainly be no investigation photons after wave collapse. -- [[User:Hkmaly|Hkmaly]] ([[User talk:Hkmaly|talk]]) 12:12, 22 September 2015 (UTC) | :Not really - or at least not real. There may be some "potential photons" in some attempts to describe some quantum-based theory ... but there will certainly be no investigation photons after wave collapse. -- [[User:Hkmaly|Hkmaly]] ([[User talk:Hkmaly|talk]]) 12:12, 22 September 2015 (UTC) | ||
− | |||
::"Everything we call real is made of things that cannot be regarded as real." - Niels Bohr. (Whether or not he's ultimately right, it's an explanation.)[[Special:Contributions/141.101.99.12|141.101.99.12]] 13:48, 22 September 2015 (UTC) | ::"Everything we call real is made of things that cannot be regarded as real." - Niels Bohr. (Whether or not he's ultimately right, it's an explanation.)[[Special:Contributions/141.101.99.12|141.101.99.12]] 13:48, 22 September 2015 (UTC) | ||
Line 37: | Line 34: | ||
I strongly suspect this also references the concept of the Oracle machine as it relates to the NP hardness of the traveling salesman problem. TSP is in the complexity class NP Complete, and part of the most common proof that it is NP hard involves showing that it reduces to a polynomial time algorithm (and hence potentially practically computed) if there exists an oracle that can tell you if a route is optimal (the fastest) in constant time. I have never edited here before and don't know all the etiquette, so I leave it to a more experienced editor to consider this in the main article. The "ghost" would then be related to the Oracle because many real world "oracles" (as in fortune tellers or weird tripping priestesses of Apollo) claim to get answers by talking to ghosts. [[Special:Contributions/108.162.219.173|108.162.219.173]] 22:17, 22 September 2015 (UTC) tomb | I strongly suspect this also references the concept of the Oracle machine as it relates to the NP hardness of the traveling salesman problem. TSP is in the complexity class NP Complete, and part of the most common proof that it is NP hard involves showing that it reduces to a polynomial time algorithm (and hence potentially practically computed) if there exists an oracle that can tell you if a route is optimal (the fastest) in constant time. I have never edited here before and don't know all the etiquette, so I leave it to a more experienced editor to consider this in the main article. The "ghost" would then be related to the Oracle because many real world "oracles" (as in fortune tellers or weird tripping priestesses of Apollo) claim to get answers by talking to ghosts. [[Special:Contributions/108.162.219.173|108.162.219.173]] 22:17, 22 September 2015 (UTC) tomb | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− |