'Proof costas busch' presentation slideshows

A Universal Turing Machine

1.09k views • 61 slides

The Post Correspondence Problem

The Post Correspondence Problem. Some undecidable problems for context-free languages:. Is ?. are context-free grammars. Is context-free grammar ambiguous?. We need a tool to prove that the previous problems for context-free languages

920 views • 59 slides

NP-complete Languages

NP-complete Languages. Polynomial Time Reductions. Polynomial Computable function : . There is a deterministic Turing machine. such that for any string computes in polynomial time: . Observation:. since, cannot use more than tape space in time .

637 views • 50 slides