dnautics
Joined 16 years ago
Joined 16 years ago
Sounds like you are vastly overestimating the intelligence of the median.
https://www.sciencealert.com/scientists-say-something-is-wro...
> This does not appear, at least to my mind, to have direct bearing on observable trends in general population IQ in the short term, nor does it appear to be addressing future outcomes
No but the proposed mechanism in Idiocracy is clear, and that is not happening. We may still head towards an dumb future, but it's not Idiocracy.
https://ifstudies.org/blog/more-babies-for-the-rich-the-rela...
P means "this problem can be solved in polynomial # of steps relative to the problem size"
NP means "we don't know if the problem can be solved in polynomial # of steps relative to problem size, but we know we can check if the result is correct in a polynomial # of steps relative to the problem size"
!ETH: it was widely suspected that the flagship problem in NP, 3SAT, requires an exponential # of steps relative to problem size. We now know that 3SAT requires AT MOST something more than polynomial but strictly less than exponential to solve.
"P = NP" means "if you can check it in polynomial time, there's some way to solve it in polynomial time". "P != NP" means "there are some problems checkable in polynomial time for which there is no polynomial way to obtain the result"
Today's new proof makes "P = NP" "feel more likely", because we know that the flagship problem in NP is not exponential.
Currently Open-Source projects: memory safety for zig. (https://github.com/ityonemo/clr/ and inline zig for elixir (https://github.com/ityonemo/zigler)
yt code channel: https://www.youtube.com/playlist?list=PLf5mA1y1vDNlydJ8d5CmSteyr6Zmp4rjS
isaac dot yonemoto at the only other useful "alphabet" service