ago
0 like 0 dislike
0 like 0 dislike
Basically the title.
ago
by
0 like 0 dislike
0 like 0 dislike
Wdym by...
- "[more] powerful than a Turing machine"?
- "violated the Church-Turing [thesis]"?
ago
0 like 0 dislike
0 like 0 dislike
I do not see how something could "violate" the Church-Turing thesis (did you mean that by the "Church-Turing hypothesis"?). Could you explain more in detail what you mean by that?

It is about formalizing an informal concept. One could argue that this is not the correct rendering (such as
László Kalmár did in 1959). And I guess you could violate it by finding an "effectively calculable function" that is not computable by Turing machines? But no such thing has been found so far.
ago
by
0 like 0 dislike
0 like 0 dislike
No
ago
0 like 0 dislike
0 like 0 dislike
Apparently quantum computers are equivalent individually, but there are distributed algorithms and protocols that you can do with quantum computers that doesn't work on normal TMs.
ago

No related questions found

33.4k questions

135k answers

0 comments

33.7k users

OhhAskMe is a math solving hub where high school and university students ask and answer loads of math questions, discuss the latest in math, and share their knowledge. It’s 100% free!