Previous
Next
Effective Computability
-
Programs that transverse search-spaces, use Prolog. Such GOFAI programs are a vanishingly tiny part of all written software.
- The other construal, called effective computability,of complexity, universal Turing Machines, computability, and so on, reigns supreme with most other software.
- Yet it makes little claims on a syntax or semantics distinction, more interested in the physics of the phenomena: Can an actual machine compute a function, how much time and space does this take up?
- Usually thought of as a theory of mathematical functions over numbers.
- Despite its mathematical nature, what is the math modeling? Actual computers!
-
A Turing Machine consists of marks on a tap, a machine that both inputs and outputs those marks changing states, and the marks denote numbers while the machine itself computers a function. Note difference between n' and m - these are numerals or marks on the tape, while n and m are actually numbers.
-