Key points are not available for this paper at this time.
We begin with two results in mathematical logic, the Church-Turing thesis (sometimes called Church's thesis) and Turing's theorem.For our purposes, the Church-Turing thesis states that for any algorithm there is some Turing machine that can implement
John R. Searle (Thu,) studied this question.