Philosophy 3340
Symbolic Logic II

Spring, 2013

Course Materials

This page contains links to materials for PHIL 3340. From here, you can access:

Syllabus

Assignments

Project

Materials from previous semesters (not necessarily a reliable indication of what we'll do this time!)

Review for First Exam (Updated 2-12-2010)

Review for First Exam (2006)

Review for Second Exam (2006)

Review for Final Exam (2006)

Review for First Exam (2004)

First Exam - Sample Questions (2004)

First Exam - Sample Questions - Answer Key (2004)

Review for Second Exam (2004)

Review for Final Exam (2004)

Sample Final Exam:

without answers (2004)
with answers (2004)

Notes

Turing machine emulator. This is a link to a Windows executable. You should be able to right-click the link, choose "save target as . . .," and save the program to your own computer. If you have a Windows machine, you'll even be able to run it! (Just click on the icon.) Pretty basic, runs in a DOS window. When you start it, it asks you for three things: (1) a description of the tape you want to run your machine on. This should use B's for blanks and 1's for strokes, so you might type in, for example,

B1111111BBBB

(2) which square of the tape you want the TM to start on. The first square is square 0, the second is square 1, and so on, so on the above tape if you wanted the machine to start on the leftmost 1, you would answer "1". (3) The program. This can either be input one line at a time or read from a file. Each line of the program consists of initial state, input, output, end state, in that order, with spaces to separate them.. So for instance "1 1 R 1" says that if the machine is in state 1 and sees a 1 it should move one square to the right and stay in state 1. You can input the instructions in any order. After you've entered the last line, when prompted for another line, just type "done" to start running the simulation. The simulation will print the first state of the tape; after that you need to hit a key each time you want to see the next state of the tape (otherwise it goes way too fast to see what's going on).

You are also given the opportunity to modify one or more lines of the program between executions, and to save a program to a file.

If you use a Linux machine, Mac, etc., I can give you the source code if you want to compile and run it on your own system -- just let me know.

Some TM programs you can try the simulator on:

3.4 - Matt's version
3.4 - Tristan's version
machine to compute min(x,y) (mine)
machine to duplicate a series of strokes (Matt & Stefanie)

Some Relevant Notes from Symbolic Logic I

Decidability
Gdel's Incompleteness Theorems
Intro to Set Theory



Last update: January 16, 2013.
Curtis Brown|Symbolic Logic II |Philosophy Department | Trinity University
cbrown@trinity.edu