Revision as of 21:25, 7 August 2020 edit 2a02:587:4118:7ca3:2891:994b:40b:f97d (talk) →Bellman–Ford algorithm in the informational description of the black hole ← Previous edit		Revision as of 21:42, 7 August 2020 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,646 edits →Bellman–Ford algorithm in the informational description of the black hole: off-topic Next edit →
Line 66: Write the text. Does the shortest path of the informational chunks always result in a mixed state? We want that because a pure state will lead to informational loss. One other option is that informational loss exists, but isn't fundamental, because it is the result of untangling a more fundamental field, and dissipating that infoloss into the same spacetime field as virtual particles. <!-- Template:Unsigned IP --><small class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/2A02:587:4118:7CA3:2891:994B:40B:F97D\|2A02:587:4118:7CA3:2891:994B:40B:F97D]] ([[User talk:2A02:587:4118:7CA3:2891:994B:40B:F97D#top\|talk]]) 21:15, 7 August 2020 (UTC)</small> <!--Autosigned by SineBot--> :Whether this has anything real to do with shortest paths, or is just buzzword salad, I'm not sure, but it doesn't appear to have anything to do with this article, which is about a specific method for finding shortest paths and not on the general topic of shortest paths. And it also appears to be off-topic for this talk page, which is about improvements to the article based on published [[WP:RS\|reliable sources]]. —[[User:David Eppstein\|David Eppstein]] ([[User talk:David Eppstein\|talk]]) 21:42, 7 August 2020 (UTC)

Talk:Bellman–Ford algorithm: Difference between revisions