Machine-translated by Google. Questions are authored in English.
Top

Discussion

What is the Church Turing thesis?

  • A.Any function can be computed given sufficient time and memory
  • B.Human thought can be reduced to a sequence of symbolic operations
  • C.Every problem in artificial intelligence has an algorithmic solution
  • D.Any effectively calculable function can be computed by a Turing machine

Answer: D

The thesis identifies the informal notion of an effective procedure with the formal class of Turing computable functions, and it is a claim about definitions rather than a theorem. It does not assert that every function is computable, since most are not, nor does it make any claim about human thought or about the solubility of particular problems. Distinguishing a definitional thesis from an empirical claim is important when it is invoked in arguments about machine intelligence, as it frequently is.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.