Pls check if this statments are TRUE or FALSE :

The set of all languages is uncountably infinite.

Space complexity is measured in the number of cells on the tape that the Turing Machine will visit during computation.

Rules for transforming one statement into another while preserving truth are referred to as rules of inference or deduction

For any transformation function on Turing Machines there will never exist a Turing Machine which would be unchanged by the transformation

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

For a computable function the Turing Machine will always halt.

The linear complexity class is not considered polynomial time.

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

A logic expression IFF may stand for if and only if$.$

Context Free Languages are generated by Context Free Grammars

NP is the class of languages that have polynomial$-$time verifiers.

It is unknown whether P and NP are actually the same class.

Turing Machines and Lambda Calculus are not equivalent in power

A problem if two grammars are equivalent is not decidable

Computation of a deterministic Turing Machine can be shown on a tree in contrast to computation of a Nondeterministic Turing Machine.

All different variations of Turing Machines are equivalent in computing capability

The Turing Machine is not necessarily deterministic

It is certain that the PSPACE class is not equal to the EXPSPACE class

Accordingly to the Church$-$Turing Thesis an algorithmically computable problem is a problem computable by a Turing Machine