On Heuristic Time Hierarchies

We study the existence of time hierarchies for heuristic algorithms. We prove that a time hierarchy exists for heuristic algorithms in such syntactic classes as NP and co-NP, and also in semantic classes AM and MA. Further, we present an alternative approach to proving time hierarchies for heuristic algorithms in BPP. This leads to a simpler proof than the one known before.