Which of these statements on computational complexity theory foundations are correct:

For any transformation function on turing machines there will never exist a turing machine which would be unchanged by the transformation.

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

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

The set of all languages is uncountably infinite