Time loop

Time Loop

Time loop or temporal loop is a plot device in which characters repeat the period of time and are experienced again, and there is often some hope of getting out of the cycle of repetition. The use of time-loop is sometimes used to refer to a cause loop, although they appear to be the same, because the loops are irreversible and self-produced, while the time loops are constantly being reset: when a certain position is found As the death of a character or a clock reaches a certain time, the loop starts again, with one or more characters who retain memories from the last loop.

Time Loop as a puzzle

Over time, stories are usually focused on the character learning through each successive loop through time. Jeremy Douglas, Janet Murray, Noah Falstein and others compare time with video games and other interactive media, wherein a loop a character learns more about their environment with each passing loop, and loop The character ends with the full mastery of the environment. Shala Garcia-Catalan et al. While providing a similar analysis it has been said that for the hero, the common way to get out of the loop is to gain knowledge, progress through using memories and eventually get out of the loop. The time loop is the process of solving a problem, and the narrative becomes like an interactive puzzle.

Time Loop logic

Time-Loop Logic, which is coined by robotic and futurist Hans Morayevac, is a fictional system of calculation that uses the Turing machines to compute the computational complexity with the standard model, to calculate faster than the answer, Novikov's self-stability Explains the principle. In this system, a computer sends the results of computation through time and depends on the self-consistency principle to force the sent result to be correct, provided that the machine can obtain information in the future and algorithm and underlying Could provide mechanism Are formally correct. An inaccurate result or a result may still not occur if the time travel mechanism or algorithm is not guaranteed to be accurate.

A simple example is an iterative method algorithm. Moravec explains:

• Creates a computing box that accepts an input, which represents almost the solution to some problem, and produces an output which is a better approximation. Conventionally, you apply this kind of calculation in a finite number of times, and then arrange for better, but still approximate results. Looking at an appropriate negative delay, something else is possible: the result of each recurrence of the function is brought back to time to serve as "first-time". As soon as the machine is active, a so-called "fixed point" of F, an input that produces a similar output, usually indicates a perfect answer, immediately (and by an exceptionally coincidentally!). If the recurrence does not converge, that is, if F is not a fixed point, then computer output and input will be closed or hovering in an unexpected intermediate position.