Tutorial Ten Before electronic computers were developed, logicians and mathematicians
worked out the foundations of computation. The idea was, and is, that Alan Turing was one of these logician-mathematicians. We'll look at one of his "machines" in a moment... ...but first we need to consider a preliminary matter. Recall the difference between But semantics gives Much of symbolic logic can be accomplished by formal manipulation on
the syntactic side which nonetheless For example, we've seen that P > Q We can understand meaning (that this argument is valid) just by understanding syntax (that this argument has a correct form). Turing machines – and computation in general – give us another example of syntax standing in for semantics. Let's see how this works. |