which are ture?

A language is context$-$free if for example there exists a Pushdown Automaton that recognizes it$,$ but also in other cases.

The Turing Machine is a computational model that can be considered as a model for all computers.

For a computable function the Turing Machine will always halt.

The linear complexity class is not considered polynomial time.