Theoretical computer science and computational complexity have limitations in terms of what problems they may prove to be hard. They may, however, provide evidence or rule out the possibility of fast classical algorithms for specific tasks.