If Space-Time Is Discrete, We May Be Able to Solve NP-Hard Problems in Polynomial Time

Authors

Ricardo Alvarez, The University of Texas at El PasoFollow
Nick Sims, El Paso Community CollegeFollow
Christian Servin, El Paso Community CollegeFollow
Martine Ceberio, The University of Texas at El PasoFollow
Vladik Kreinovich, The University of Texas at El PasoFollow

Publication Date

8-2019

Comments

Technical Report: UTEP-CS-19-85

Abstract

Traditional physics assumes that space and time are continuous. However, this reasonable model leads to some serious problems. One the approaches that physicists follow to solve these problems is to assume that the space-time is actually discrete. In this paper, we analyze possible computational consequences of this discreteness. It turns out that in a discrete space-time, we may be able to solve NP-hard problems in polynomial time.