The Church Tering Thesis Is Probably True

Most computer scientists now think that this is the case. Anything that you can compute, you can compute on an appropriately programmed touring machine. But there are functions that are known to be unable to be computed by a tering machine. The church turing thesis is essentially saying that anythingth it can compute, a terring machine can compute. It's potentially useful for their abstract form of thinking about computation.