You're looking at Less Wrong's discussion board. This includes all posts, including those that haven't been promoted to the front page yet. For more information, see About Less Wrong.

Squark comments on Computation complexity of AGI design - Less Wrong Discussion

6 Post author: Squark 02 February 2015 08:05PM

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

Comments (69)

You are viewing a single comment's thread. Show more comments above.

Comment author: Squark 03 February 2015 06:29:24AM 1 point [-]

By "algorithm" I meant a program that terminates on all inputs. Maybe I should have been more specific.

Comment author: [deleted] 04 February 2015 12:48:26AM 0 points [-]

That is very atypical terminology.

Comment author: Squark 05 February 2015 08:30:32AM 2 points [-]

According to Wikipedia, "an algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing output and terminating at a final ending state." There is a linked quote of Knuth who says "A procedure which has all the characteristics of an algorithm except that it possibly lacks finiteness may be called a 'computational method'".

Also, even if the terminology is atypical the charitable reader should be able to understand the intent.