moot✳
A little more connected.
Join Moot

konstiwohlwend

@konstiwohlwend

Social handles

Browse matching posts and comments already imported to Moot, including those shared before signup.

The complexity theory result is actually huge.

P problems can be solved in polynomial time. It was widely believed that NP-complete problems require exponential time.

P = NP states that NP-complete problems can be solved in polynomial time. OpenAI didn't prove that. But, they proved that (some) NP-complete problems can be solved faster than exponential time, meaning:

  • P = NP, or
  • the comp…
Greg Brockman@gdb

Announcing three major scientific discoveries, one each in mathematics (harmonic analysis), computer science (complexity theory), and physics (quantum field theory).

AI starting to help us improve our understanding of the universe! https://openai.com/index/building-scientific-understanding-with-academic-communities/

View on X
#complexity theory#p vs np#computer science
1
0 comments