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/9719763
Reachability in Vector Addition Systems is Ackermann-complete, Wojciech Czerwinski and
Lukasz Orlikowsk
https://ieeexplore.ieee.org/document/9719806
Watch our full video explainer: https://www.youtube.com/watch?v=IzSs_gJDVzI
Read the article: https://www.quantamagazine.org/an-easy-sounding-problem-yields-numbers-too-big-for-our-universe-20231204/
--------
- VISIT our website: https://www.quantamagazine.org
- LIKE us on Facebook: https://www.facebook.com/QuantaNews
- FOLLOW us Twitter: https://twitter.com/QuantaMagazine
@QuantaScienceChannel
#math #computerscience