Hello,(adsbygoogle = window.adsbygoogle || []).push({});

I an new to this subject. I was going over Church Turing thesis.

There are certain concepts which I am unable to understand. If somebody can help me understand:

The thesis states:'every effective calculable function is a computable function'.

Now, here what does a function means? Is it the same as we know in mathematics as y=f(x)?

The three ways of computability, the lambda calculus, Turing machine and recursive function define the same class of function. What is meant by that?

Can anybody please help me?

What is

(a) primitive recursive function?

(b) general recursive function

Thanks

-- Shounak

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Church Turing thesis

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

Loading...

Similar Threads - Church Turing thesis | Date |
---|---|

[Theoretical computer science] Regular Turing Machine undecidable proof | Aug 22, 2015 |

How the original Turing machine broke the enigma | Mar 16, 2015 |

Help explain this Turing machine notation | Oct 6, 2014 |

Turing machines and circuits | Apr 28, 2014 |

**Physics Forums - The Fusion of Science and Community**