Squark comments on Computation complexity of AGI design - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (69)
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.