Graphics Turing Test Graphics Turing Test In computer graphics the Graphics Turing Test is a variant of the Turing Test, the twist being that a human judge viewing and interacting with an artificially generated world should be unable to reliably distinguish it from reality. The original formulation of the test is: The "Graphics Turing Scale" of computer power is then defined as the computing power necessary to achieve success in the test. It was estimated in as 1036.8 TFlops peak and 518.4 TFlops sustained. Actual rendering tests with a Blue Gene supercomputer showed that current supercomputers are not up to the task scale
Turing completeness is that there exist problems for which it is impossible to predict what a (Turing-complete) system will do over an arbitrarily long time. The classic example is the halting problem: create an algorithm which takes as input (a) a program in some Turing-complete language, and (b) some data to be fed to "that" program; and which determines whether the program, operating on the input, will eventually stop or will continue forever. It is trivial to create an algorithm that can do this for "some" inputs, but impossible to do this in general. For any characteristic of the program's eventual output,