Possible Duplicate:
What would it mean to disprove Church-Turing thesis?

Are there any models of computation currently being studied with the possibility of being more powerful than Turing Machines?


marked as duplicate by M.S. Dousti, András Salamon, Suresh Venkat Dec 3 '10 at 17:13

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

  • 3
    $\begingroup$ Yes. For instance, the circuit model (non-uniform Turing machines). But I don't think this is a research-level question, as per FAQ. You may ask it on math.stackexchange.com $\endgroup$ – M.S. Dousti Dec 3 '10 at 14:54
  • 5
    $\begingroup$ @Sadeq Dousti: Thank you, but I am interested in uniform models. I want to learn about models which are being studied by researchers, doesn't that make it a research-level question? $\endgroup$ – Aadita Mehra Dec 3 '10 at 15:00
  • 1
    $\begingroup$ Sounds like a reasonable question to me, but any answers are likely to be a subset of those for cstheory.stackexchange.com/questions/88/… even if the precise wording might be useful to keep around for searches. $\endgroup$ – András Salamon Dec 3 '10 at 15:22
  • $\begingroup$ @András: you are right. I wrote and deleted an answer, after I realized it was already an answer to the question you mentioned. $\endgroup$ – Alessandro Cosentino Dec 3 '10 at 15:30
  • 1
    $\begingroup$ @Kaveh: cstheory.stackexchange.com/questions/88/… links to the Wikipedia article, presumably that is why Alessandro deleted the answer. $\endgroup$ – András Salamon Dec 3 '10 at 15:34