# Module13 - Module 13 Studying the internal structure of REC...

This preview shows pages 1–6. Sign up to view the full content.

1 Module 13 Studying the internal structure of REC, the set of solvable problems Complexity theory overview Automata theory preview Motivating Problem string searching

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2 Studying REC Complexity Theory Automata Theory
3 Current picture of all languages Α ll Languages RE-REC Α ll languages - RE Half Solvable Not even half solvable Which language class should be studied further? REC Solvable

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
4 Complexity Theory In complexity theory, we differentiate problems by how hard a problem is to solve Remember, all problems in REC are solvable Which problem is harder and why? Max: Input: list of n numbers Task: return largest of the n numbers Element Input: list of n numbers Task: return any of the n numbers REC RE - REC All languages - RE
5 Resource Usage * How do we formally measure the hardness of a problem? We measure the resources required to solve input instances of the problem Typical resources are?

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 15

Module13 - Module 13 Studying the internal structure of REC...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online