Church Turing thesis is a combined hypothesis about the nature of functions with computable values. Church Turing thesis states: “Everything computable is computable by a Turing Machine”. Church Turing thesis can’t be proven formally but now it is accepted universally. Mathematicians used different computational processes including recursion, λ-Calculus and Turing Machine to formulate notion of computability and found each method to be equivalent. Church Turing thesis got the name after names of mathematicians, Alonzo Church and Alan Turing. The thesis formulated by Alonzo Church and Alan Turing may be rephrased as: “Notion of an effective or mechanical method in logic and mathematics is captured by the Turing Machine”. Here are the four requirements which an effective or mechanical method must follow:

1. It should consist of a finite set of symbols and instructions described with a finite number of symbols.
2. It should produce results in a finite number of steps.
3. In essence, it can be carried out by the human being only with a paper and pencil.
4. No intelligence of humans is required to execute it except that which is needed to understand and execute the instructions.

Success of Church Turing thesis has replaced the informal phrase “effectively computable” and formalized the concept of computation. Church Turing thesis can be applied to Physics and when it is applied to physics, the thesis yield different meanings which are listed below:

Meaning # 1: “The Universe Is A Turing Machine”.

Meaning # 2: “The Universe Is Not A Turing Machine, But Incomputable Physical Events Are Not “Controllable” For The Construction Of A Hyper Computer”.

Meaning # 3: “The Universe Is A Hyper Computer, And It Is Possible To Build Physical Devices To Harness This Property And Calculate Non-Recursive Functions”.

In a nutshell, Church Turing thesis indicates that hyper computation is possible.