<blockquote>
  <p><strong>Possible Duplicate:</strong><br>
  <a href="https://cstheory.stackexchange.com/questions/88/what-would-it-mean-to-disprove-church-turing-thesis">What would it mean to disprove Church-Turing thesis?</a>  </p>
</blockquote>



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

CC BY-SA 2.5
2010-12-03T14:54:11.997Z
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
Sadeq Dousti
CC BY-SA 2.5
2010-12-03T15:00:52.430Z
@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?
Aadita Mehra
CC BY-SA 2.5
2010-12-03T15:22:56.070Z
Sounds like a reasonable question to me, but any answers are likely to be a subset of those for http://cstheory.stackexchange.com/questions/88/what-would-it-mean-to-disprove-church-turing-thesis even if the precise wording might be useful to keep around for searches.
András Salamon
CC BY-SA 2.5
2010-12-03T15:30:03.120Z
@András: you are right. I wrote and deleted an answer, after I realized it was already an answer to the question you mentioned.
Alessandro Cosentino
CC BY-SA 2.5
2010-12-03T15:34:18.187Z
@Kaveh: http://cstheory.stackexchange.com/questions/88/what-would-it-mean-to-disprove-church-turing-thesis/90#90 links to the Wikipedia article, presumably that is why Alessandro deleted the answer.
András Salamon
<computability><physics><machine-models><natural-computing>
Are there any models of computation currently being studied with the possibility of being more powerful than Turing Machines?
Aadita Mehra
# Are there any models of computation currently being studied with the possibility of being more powerful than Turing Machines?

(Asked by: username_0 on 2010-12-03)

> **Possible Duplicate:**  
> [What would it mean to disprove Church-Turing thesis?](https://cstheory.stackexchange.com/questions/88/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?

**Tags:** computability, physics, machine-models, natural-computing

> **Comments:**
> **username_1**: 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  
> **username_0**: @username_1: 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?  
> **username_2**: Sounds like a reasonable question to me, but any answers are likely to be a subset of those for http://cstheory.stackexchange.com/questions/88/what-would-it-mean-to-disprove-church-turing-thesis even if the precise wording might be useful to keep around for searches.  
> **username_3**: @András: you are right. I wrote and deleted an answer, after I realized it was already an answer to the question you mentioned.  
> **username_2**: @Kaveh: http://cstheory.stackexchange.com/questions/88/what-would-it-mean-to-disprove-church-turing-thesis/90#90 links to the Wikipedia article, presumably that is why Alessandro deleted the answer.  

---

## 0 answers

