in computer science, we talk about a mathematical construct called a machine. Different kinds of machines can solve different problems, and the turing machine is the most powerful. It can solve any problem that can be solved by a machine.
Turing machines operate one step at a time, with each step taking the same amount of time. The total number of steps it takes to solve a problem is the time, of that machine.
Some problems have a fixed number of inputs, like "list all the states". These machines have a fixed time. We call this constant time.
Others can have a variable number of inputs, like add up an arbitrary list of numbers. The longer the list is, the longer this takes.
An interesting, and important question is, how fast does the time of a machine go up as we add more inputs?
There are to major groups: the machines were the time goes up in a polynomial way (called P) and the ones were it goes up faster (called NP for non-polynomial). This means, for some machines, you can describe the time with an equation like time=inputs^n where n is any number.
A conjecture is that actually, all problems (that can be solved ) have a machine that can do in P time, thus all NP problems are actually P problems if we find the right machine.
This is important because much of our secret codes and other inportant things that we use today rely on those NP problems, which are really hard to solve. But if it turns out that they are P problems after all, there can be easy solutions.
In general, P = NP means that some algorithms will become much faster to solve. We have some algorithms that we depend on being hard. Most notable is encryption. We depend on it being hard for am attacker to crack the encryption (but easy for someone who already knows the answer -- eg, your password). P = NP might (but not necessarily) make it easy enough for encryption to therefore be broken.
I say not necessarily because while P = NP does mean certain types of algorithms will become faster (in at least certain cases), it's still possible for them to be quite slow. P and NP refer to how long algorithms take, based on how they scale with input. P is polynomial and NP is non-polynomial. Polynomial functions scale far better than non-polynomial functions, but that doesn't mean they necessarily scale well, as there's plenty of types of polynomial functions, some which scale far, far better than others.
Physicists and chemists can't actually destroy the world in such ways. But creating a deadly virus and releasing it by mistake or not is quite a realistic possibility.
Well I haven't been following the story anymore for the last year or so, but there were some suspicions regarding that level 4 bio-lab doing research on Coronaviruses in the very epicenter of the 2019 pandemic, Wuhan...
book prose star steel smoke relation minute milk frame south feeble town ray instrument island red for look dark medical word curve burn fixed ray end moon agreement rule flame no bit burst drop idea earth who expansion memory wind tin such umbrella daughter simple monkey letter small about natural
eye thin rough as rice reward chain talk early kiss force with even delicate laugh fish loose feeble school cake comparison humour store bridge bit round degree let jump across wire sail wire sail living because cloth science oil cheese field limit debt salt natural basin observation till substance wool
wise place rhythm that note finger view clear shake house though stomach little man cold verse open opposite dry serious different design steam complex edge burst shelf amusement flower brick wire trade porter touch public black crime business brass such by mass slow answer dog again effect before name spade
small clear loss healthy poison family tin addition brown industry wine vessel as little new please kick jump blue mine salt wine love every sharp public second butter space ticket key produce knot root garden direction this group join enough store grip history air regret hanging much way process need
chalk opinion shirt every narrow damage sugar yellow crime head balance here let electric brick frame dust silver off mountain street window and yellow cotton judge cheese baby note time basket argument tail surprise act night fowl look join account plough history please canvas bad short brown bright dry voice
powder flame statement money train ink arch late so limit among brick sock decision market rate debt say school ear low ornament office ready tight see knife skin some meat property birth talk night shake food bed effect elastic have fall secret fire request important boy bridge make ornament room
line education ship safe loss I married long music meat slip brake operation order pain stitch second observation insurance sponge loss distance credit increase sister needle hair any sock put food be strong violent lock kettle value jump long shirt horn guide board record before bone land who island make
ink together hook voice representative business group still before complex increase separate dust all among place in respect look keep against drawer oven bright poison sand sharp measure burn poor till rice send he of for female will hand insurance night condition at motion between structure future side bath credit