Computationalism and qualia-completeness

Computationalism can be framed as the thesis that all Turing-complete systems are also “qualia-complete” — that any Turing machine can generate any qualia.

If we can decisively prove this true or false, we can infer much about the future, and avert much conflict.