Hilbert Godel Turing and the Computer Decision Problem

ebook Mathematics

By James Constant

cover image of Hilbert Godel Turing and the Computer Decision Problem

Sign up to save your library

With an OverDrive account, you can save your favorite libraries for at-a-glance information about availability. Find out more about OverDrive accounts.

   Not today

Find this title in Libby, the library reading app by OverDrive.

Download Libby on the App Store Download Libby on Google Play

Search for a digital library with this title

Title found at these libraries:

Library Name Distance
Loading...

Is there a procedure or algorithm that can decide whether statements, mathematical or non-mathematical, are true or false, win or draw? The broader decision problem can be stated as follows: Even though a mathematical or non-mathematical statement is undecidable in general, it may be possible to find a special algorithm that makes a computer model stop or checkmate. A computer model stops when a true or false decision is made. A computer model game ends when a checkmate win or draw occurs.
Philosophically, no procedure can decide whether statements in science, reason, and faith are true or false, win or draw. While it is theoretically possible to find exceptions to this rule, such exceptions are not possible absent confirmation and/or with less than perfect artifacts, computers and software, and less than perfect man-skills. True and false statements abound in science, less so in reason and non in faith.[10]

Hilbert Godel Turing and the Computer Decision Problem