4 ms·
P?=NP isn't the question of, "If given an infinite number of monkeys can one compute an exponential problem really quickly?" Its the question of, "Does a mappi
by anonuser123456 5y ago
P?=NP isn't the question of, "If given an infinite number of monkeys can one compute an exponential problem really quickly?"
Its the question of, "Does a mapping exist from that fast infinite monkey machine to a finite monkey machine that runs in polynomial time?"
I think parent's question is "Can the problem be encoded such that one can prove that no translation can prune the number of monkeys required at an exponential rate?" I have wondered that myself, but never found any particularly useful answer.
- sova 5y agoYes, but is it right to approach this question from sequence just because computation implies sequence? Mathematics has an equals sign and suggests not the computational sequence, just the logical sequence of our axioms mapped to self-evident fact. Mathematics to Information Theory to Computation naturally goes from clear postulates and language-able axioms to water-wheelable traits. I suggest there is some room for exploration in between.