The class of decision problems that can be proven to be solvable in O(f(n)) time on a deterministic Turing machine, from the axioms of formal system F.
Defined in [Har78], where the following was also shown:
See also F-TAPE(f(n)).
The class of decision problems that can be proven to be solvable in O(f(n)) space on a deterministic Turing machine, from the axioms of formal system F.
Defined in [Har78].
See also F-TIME(f(n)). The results about F-TAPE mirror those about F-TIME, but in some cases are sharper.