Talk:Bellman–Ford algorithm: Difference between revisions

Content deleted Content added
SineBot (talk | contribs)
m Signing comment by 2A02:587:4118:7CA3:2891:994B:40B:F97D - "==Bellman–Ford algorithm in the informational description of the black hole== Write the text."
Line 64:
==Bellman–Ford algorithm in the informational description of the black hole==
 
Write the text.
Write the text. <!-- Template:Unsigned IP --><small class="autosigned">—&nbsp;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-->
 
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.