|Nov30-12, 10:47 PM||#1|
Church Turing thesis
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?
(a) primitive recursive function?
(b) general recursive function
|Similar Threads for: Church Turing thesis|
|MS Medical Physics: Thesis or Non-thesis Option||Academic Guidance||3|
|Church'e thesis||Set Theory, Logic, Probability, Statistics||1|
|x+y Turing machine||Calculus & Beyond Homework||4|
|No! Not Church!||General Discussion||76|
|Turing machine help!||Engineering, Comp Sci, & Technology Homework||0|