Researchers use a process called formal verification to ensure critical computer programs are free of bugs. Inside this process is a math problem call the reachability problem for vector addition systems. Find out how this problem was solved by computer scientists:

The Reachability Problem for Petri Nets is Not Primitive, Jerome Leroux
Recursivehttps://ieeexplore.ieee.org/document/...

Reachability in Vector Addition Systems is Ackermann-complete, Wojciech Czerwinski and
Lukasz Orlikowsk
https://ieeexplore.ieee.org/document/...

Watch our full video explainer:    • Why Is This Basic Computer Science Pr...  


Read the article: https://www.quantamagazine.org/an-eas...

--------
- VISIT our website: https://www.quantamagazine.org
- LIKE us on Facebook:   / quantanews  
- FOLLOW us Twitter:   / quantamagazine  
@QuantaScienceChannel

#math #computerscience