How do I reduce every problem in the world to a Turing Machine?

How do I reduce every problem in the world to a Turing Machine? Deterministic or nondet.
How do I reduce every problem in the world to a Turing Machine? Deterministic or nondet.

At the very least you’d run into problems with the computability of real numbers.

Student Answer: If you're curious to know the answer to these types of questions, I reccomend taking computational complexity theory (CS elective). *Not every problem is decidable, those solvable by a TM or a TM are inP, NP!
Student Answer: If you’re curious to know the answer to these types of questions, I reccomend taking computational complexity theory (CS elective). *Not every problem is decidable, those solvable by a TM or a TM are inP, NP!

Taking a class is a great idea if you want to learn more about something. I also agree that machines can’t solve every problem (yet).