Questions tagged [church-turing-thesis]

A hypothesis about the nature of computable functions. It states that a function on the natural numbers can be calculated by an effective method if and only if it is computable by a Turing machine.

1 question with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
5 votes
0 answers
96 views

Consequences of MIP*=RE regarding quantum universality

Provided that $\mathsf{MIP}^*=\mathsf{RE}$ there can be Bell inequalities that have violations achievable only for infinite dimensional quantum systems (vide discussions in Post1 and Post2). Does this ...
R.W's user avatar
  • 2,302