> Besides, there is no true Turing complete languages as we are dealing with finite computers. This is not true. Turing complete languages are so because thei

> Besides, there is no true Turing complete languages as we are dealing with finite computers. This is not true. Turing complete languages are so because their halting problem is undecidable, it is irrelevant that the computer you run a python program has finite memory. Check out languages like Agda where you can do general purpose computing but are not Turing complete, since all programs can be proved to halt.