It is not the case that Strict finitists reject infinite sets and unbounded computation; P/NP distinction presupposes Turing machines operating on arbitrarily large inputs.
?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.