It is not the case that Machine-relative tractability is expected and unproblematic; CET's universality applies within Church-Turing equivalence class, where polynomial-time is robust.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.