Runtime

Let $f : N \to N$ be a function

Deterministic Turing Machine - A Determinisitic Turing Machine has a runtime of $f (n)$ means that for input $x : ∣ x ∣ \in N$ , The machine Halts in Time $O (f (n))$ .
Nondeterminisitic Turing Machine - A Nondeterminisitic Turing Machine has a runtime of $f (n)$ means that for input $x : ∣ x ∣ \in N$ , The machine Halts in Time $O (f (n))$ on all paths.

🏠 No Place Like ~