FLAC What's New
FLAC Spring 2012
Schedule
Project Page
Wednesday, February 29, 2012
Homework 6, Problem 4 Clarification
In problem 4 you should assume that the input of a Turing Machine M is always a binary string (the input alphabet is {0,1}).
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment