Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

What is the Church or Turing thesis?

Answer Posted / aki

Sorry for not explaining well.
got from :
http://www.cmi.ac.in/~ramprasad/lecturenotes/algcomp/lecture20.pdf

Turing and Church had considered various computational
models, such as
Turing machines, random-access machines, and so on. All
these computational
models could be implemented through physical systems subject to
the laws of classical mechanics. While studying many such
computational
models, computer scientists came up with the following Holy
Grails:
1
1. Church-Turing thesis: This states that any computational
model
is as powerful as the Turing machine. In other words, given
any computational
model, we can simulate computations on that model using
the Turing machine. The simulation may of course involve a
blow-up
in time taken as well as in space used.
2. Strong Church-Turing thesis: This states that for any
computational
model, a polynomial-time algorithm for a decision problem in
that computational model can be simulated by a
polynomial-time algorithm
in the Turing machine model. In looser language, if we think
of polynomial time as the notion of tractability, then
tractability in
any computational model is equivalent to tractability in the
Turing
machine model.
3. Strong Church-Turing thesis (randomized version): This states
that for any computational model, a bounded-error
probabilistic polynomial
time algorithm for a decision problem in that computational
model can be simulated by a bounded-error probabilistic
polynomial
time algorithm for the problem in the Turing machine model.
In looser
language, if we think of BPP as the notion of tractability,
then BPP
is any computational model is equivalent to tractability in
the Turing
machine model.

Is This Answer Correct ?    0 Yes 0 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

Explain the Hodgkin-Huxley model of the action potential.

2036


Describe the integrate-and-fire model of individual neurons?

1867


what is tracer technique?

2587


Derive the cable equation for a uniform cylinder, with optimal boundary conditions.

2108


Explain what is information?

827


What are the disadvantages of transgenic animals for neuroscientific studies?

898


what is meant by Turing-universal?

2001


Explain the term 'windows'?

895


What is perceptual constancy ?why it is biologically important?

2357


Explain the basic principles of regulation?

809


Explain how a system of chemical reactions can be represented as ODEs and PDEs?

1877


How would you compare the computational power of a cortical pyramidal cell with that of a desktop computer?

1924


Explain the advantages and disadvantages of transgenic animals for neuroscientific studies?

819


What is a separatrix?

2251


why earth have -ve charge

2002