  The antibiotics time machine is an optimization question posed by Mira
\latin{et al.} on the design of antibiotic treatment plans to minimize
antibiotic resistance. The problem is a variation of the Markov decision
process. These authors asked if the problem can be solved efficiently. In this
paper, we show that this problem is NP-hard in general.
