Vaniver comments on Second-Order Logic: The Controversy - Less Wrong

24 Post author: Eliezer_Yudkowsky 04 January 2013 07:51PM

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

Comments (188)

Sort By: Best

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

Comment author: Vaniver 19 March 2015 05:02:35PM 2 points [-]

The Halting theorems say that you cannot write down any finite program which will recognize and identify any infinite loop

I think I would use "every" where you use "any."

Comment author: [deleted] 19 March 2015 08:46:59PM * 0 points [-]

Let's just use quantifiers.

~exist P, forall M i, P (M, i) \/ ~P (M, i).

Where P is a finite program running in finite time, M is a Turing machine, and i is an input string.