|
|
|
|
|
by kenster07
4398 days ago
|
|
The fundamental problem is actually the arbitrary separation of the practical and theoretical. They should be informing one another. Consider this: many great "theoretical" discoveries in history, including those in CS, were not theoretical at their inception. They were the result of people trying to solve practical problems -- not the product of a bunch of debt-ridden students trying to maximize GPA in an ivory tower. This cannot be overstated. At the end of the day, the distinction between academic and practical is largely self-imposed, at least partially ego-driven, and probably highly inefficient for society as a whole. If you want "practical" people to engage "theoretical" problems, then make it practical for them. |
|
10. Determination of the solvability of a Diophantine equation. Given a Diophantine equation with any number of unknown quantities and with rational integral coefficients: To devise a process according to which it can be determined in a finite number of operations whether the equation is solvable in rational integers. The Entscheidungsproblem is solved when we know a procedure that allows for any given logical expression to decide by finitely many operations its validity or satisfiability ... The Entscheidungsproblem must be considered the main problem of mathematical logic.
Computers may seem obvious in hindsight but it was formally defined to solve a theoretical mathematics problem by the mathematician Alan Turing.