I read about turing complete from this answer. From what I understood, for a programming language to be turing complete it should be able to compute everything a turing machine can.
- Lets consider Python. I know for a fact that Python is turing complete. That implies it can do anything a turing machine can do.
- Read the below snippet from Automata and computability by Dexter C. Kozen. It says that randomized alogs are not addressed by turing machines.
- We know that we can write a randomized algo(ex: Quick Sort) in Python.
Q: So, Does this mean Python(in general any Programming language) is more than turing complete?
