Lecture 8 - Church-Turing Thesis Flashcards
1
Q
Is the TM an appropriate model for the black box?
A
Yes , this is known as the Church-Turing Thesis
2
Q
Is everything effectively computable computbale by tm?
A
yes
3
Q
Is Church-Turing a theorem?
A
No it is a thesis
4
Q
Why is Church Turing true?
A
as different computational models turn out to be equivalent in terms of what they can compute
5
Q
Are counter programs equivalent to Java / C programs?
A
Yes, but harder to write
