4
P versus NP problem


Wikimedia
P versus NP problem illustration
The P versus NP problem deals with the classification of computational problems. It asks whether every problem for which a solution can be verified in polynomial time can also be solved in polynomial time. In other words, it investigates the relationship between problems that are easy to verify and those that are easy to solve.
More Science

Connecting our brains with AI - the story behind Neurolink
How far are we from connecting our brains with AI technologies?.

Slightly Embarassing Signs of High Intelligence
Being intelligent isn't all smiles and giggles.

The 6 Biggest AI Fails... So Far
Nobody's perfect - especially when it comes to algorithms.

Healthy Tech Habits For A Better, More Creative Life
Some healthy tech habits can be useful for a better, more creative existence.

How useful can be the digital contact tracing in the COVID 19 Pandemic?
How useful can be the digital contact tracing in the COVID 19 Pandemic?.