Lecture12-1_Part5

Lecture12-1_Part5 - In the future we will regard input...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
A TM that gets as input the encoding of an undirected graph, , starts its computation by verifying that the encoding is well formed. If this is not the case, the input is rejected.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: In the future we will regard input representations as implementation details and conveniently ignore them. Objects as Input 5 G...
View Full Document

This note was uploaded on 04/30/2009 for the course CSE 105 taught by Professor Paturi during the Winter '99 term at UCSD.

Ask a homework question - tutors are online