<p>Does the <a href="https://arxiv.org/abs/2001.04383" rel="noreferrer">MIP* = RE</a> result <a href="https://www.scottaaronson.com/papers/alg.pdf" rel="noreferrer">algebrize</a>?  (It doesn’t relativize, as noted <a href="https://www.scottaaronson.com/blog/?p=4512#comment-1828321" rel="noreferrer">here</a>.)</p>

<p>If it doesn’t algebrize, is there a more complicated similar notion that it does satisfy?</p>

CC BY-SA 4.0
2020-03-07T22:43:53.263Z
Algebraization is about complexity while re is about computability.
VS.
CC BY-SA 4.0
2020-03-07T22:52:09.423Z
I would it is no.
VS.
CC BY-SA 4.0
2020-03-07T22:52:16.607Z
@VS. this comment would also have applied to relativization, wouldn't it? *(sorry, updated my comment while you were answering, now the order is messed up)*
Clement C.
CC BY-SA 4.0
2020-03-10T11:09:49.720Z
@VS. Please feel free to write up an answer if your intuition can be expanded into a proof or argument.  As it is I'm not sure how to interpret "complexity" vs. "computability" formally: both notions are about sets of languages, and the question is already a well-defined question about sets of languages.
Geoffrey Irving
<quantum-computing><interactive-proofs>
Does MIP* = RE algebrize?
Geoffrey Irving
# Does MIP* = RE algebrize?

(Asked by: username_0 on 2020-03-07)

Does the [MIP\* = RE](https://arxiv.org/abs/2001.04383) result [algebrize](https://www.scottaaronson.com/papers/alg.pdf)? (It doesn’t relativize, as noted [here](https://www.scottaaronson.com/blog/?p=4512#comment-1828321).)

If it doesn’t algebrize, is there a more complicated similar notion that it does satisfy?

**Tags:** quantum-computing, interactive-proofs
> **Comments:**
> **username_1**: Algebraization is about complexity while re is about computability.  
> **username_1**: I would it is no.  
> **username_2**: @VS. this comment would also have applied to relativization, wouldn't it? *(sorry, updated my comment while you were answering, now the order is messed up)*  
> **username_0**: @VS. Please feel free to write up an answer if your intuition can be expanded into a proof or argument.  As it is I'm not sure how to interpret "complexity" vs. "computability" formally: both notions are about sets of languages, and the question is already a well-defined question about sets of languages.  

---

## 0 answers

