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

What are the differences between entropy, free energy, and enthalpy?

1904


Explain the term 'windows'?

911


What is a local field potential?

1965


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

840


What is movements?

849


What is the use of hplc, how we use the columns, what is the important in the pharma field?

800


Describe the trichromacy vs. opponency theories of color processing.

2341


Describe the differences between backpropagation and radial basis function learning networks?

1903


What is the significance of modelling and which model types do you know?

2503


What is perceptual constancy ?why it is biologically important?

2379


What is the VOR in primates?

1969


what is evolution of the continents

2033


How does the diffusion equation differ from the cable equation?

1903


What is the reason for ammeter burns out when connected in parallel?

762


Describe one algorithm for image segmentation?

1823