"Time loop logic, coined by the roboticist and futurist Hans Moravec,[11] is t..."

Time loop logic, coined by the roboticist and futurist Hans Moravec,[11] is the name of a hypothetical system of computation that exploits the Novikov self-consistency principle to compute answers much faster than possible with the standard model of computational complexity using Turing machines. In this system, a computer sends a result of a computation backwards through time and relies upon the self-consistency principle to force the sent result to be correct.

A program exploiting time loop logic can be quite simple in outline. For example, to compute one prime factor of the natural number N in polynomial time (no polynomial time factorization algorithm is known in traditional complexity theory; see integer factorization):

Novikov self-consistency principle

Comments

Written by Juraj Bednár //