4 ms·

I think I have seen a proof that any algorithm which decides whether or not something is a sandwich in general can be used to decide whether or not a turing mac

by ouid 8y ago

I think I have seen a proof that any algorithm which decides whether or not something is a sandwich in general can be used to decide whether or not a turing machine halts on no inputs.

jerf 8y ago
That only works if your sandwich bread is made of rice flour, hence the name The Rice Theorum.