Less Wrong is a community blog devoted to refining the art of human rationality. Please visit our About page for more information.

PK comments on GAZP vs. GLUT - Less Wrong

33 Post author: Eliezer_Yudkowsky 07 April 2008 01:51AM

You are viewing a comment permalink. View the original post to see all comments and the full post content.

Comments (166)

Sort By: Old

You are viewing a single comment's thread.

Comment author: PK 07 April 2008 07:15:21AM 0 points [-]

A simple GLUT cannot be conscious and or intelligent because it has no working memory or internal states. For example, suppose the GLUT was written at t = 0. At t = 1, the system has to remember that "x = 4". No operation is taken since the GLUT is already set. At t = 2 the system is queried "what is x?". Since the GLUT was written before the information that "x = 4" was supplied, the GLUT cannot know what x is. If the GLUT somehow has the correct answer then the GLUT goes beyond just having precomputed outputs to precomputed inputs. Somehow the GLUT author also knew an event from the future, in this case that "x = 4" would be supplied at t = 1.

It would have to be a Cascading Input Giant Lookup Table(CIGLUT). eg: At t = 1, input = "1) x = 4" at t = 2, input = "1) x = 4 //previous inputs what is x?" //+ new inputs We would have to postulate infinite storage and reaffirm our commitment to ignoring combinatorial explosions.

Think about it. I need to go to sleep now, it's 3 AM.

Comment author: DaveX 06 October 2011 02:26:48PM 2 points [-]

Eliezer covered some of this in description of the twenty-ply GLUT being not infinite, but still much larger than the universe. The number of plys in the conversation is the number of "iterations" simulated by the GLUT. For an hour-long Turing test, the GLUT would still not be infinite, (i.e., still describe the Chinese Room thought experiment) and, for the purposes of the thought experiment, it would still be computable without infinite resources.

Certainly, drastic economies could be had by using more complicated programming, but the outputs would be indistinguishable.