Please answer the following question. Thank you: Anything that can be computed c
ID: 3717679 • Letter: P
Question
Please answer the following question. Thank you:
Anything that can be computed can be computed by a Turing Machine." This is one way of phrasing the Church-Turing Thesis. This is not something that can be proved or disproved mathematically. Given your experience with the Turing machine simulator and the material covered in class and in the textbook, what do think about this thesis? Do you believe it? Why or why not? Do you think it is useful or interesting? (Write a couple of paragraphs in response.)Explanation / Answer
Ans. Turing machine is a mathematical model of computations and is the basis for all mordern computations.Turing machine carry out calculations from inputs by manipulating symbols on a tape.
Church-Turing thesis states that any function that can be computed by a mechanical process can be computed by a Turing machine. This is not a mathematical statement which can be proved and disapproved because this is just a theoritical model and was never intended to serve as a practical device to perform computations.l It just provide foundation for reasoning about computation and it has served above purpose very well since its invention and hence is useful in providing foundation to computability through turing machine at the time of 1936.
However if we look in mordern world we will find that,some of the functions such as the Diagonal Function (showed by Cantor) .and self negation i.e A=NOT A are not computable by Turing Machine.
.