{"id":6782,"date":"2024-09-03T10:21:55","date_gmt":"2024-09-03T13:21:55","guid":{"rendered":"https:\/\/www.inf.ufrgs.br\/profcomp\/?page_id=6782"},"modified":"2024-09-03T10:21:55","modified_gmt":"2024-09-03T13:21:55","slug":"cmp626","status":"publish","type":"page","link":"https:\/\/www.inf.ufrgs.br\/profcomp\/lista-de-disciplinas\/cmp626\/","title":{"rendered":"CMP626"},"content":{"rendered":"<h3><strong>CMP626 &#8211; Theory of Computation<\/strong><\/h3>\n<p><b>Professor<\/b>: \u00c1lvaro e Henrique<br \/>\n<b>Prerequisites<\/b>: \u2013<br \/>\n<b>Hours<\/b>: 60 hs<br \/>\n<b>Credits<\/b>: 4<br \/>\n<b>Semesters<\/b>: First and second semesters<br \/>\n<b>Undergraduate Enrollment<\/b>: \u2013<br \/>\n<b>Page Link<\/b>: \u2013<\/p>\n<p><strong>SUMMARY<\/strong><\/p>\n<p>Computability Theory: Model of Computation &#8211; Turing Machines. Church-Turing Thesis. Decidability. Reduction. Complexity theory: Time Complexity, Asymptotic analysis, worst-case analysis. Tractability &#8211; Edmond-Cobham Thesis. Time Complexity Classes. NP-Complete Problems. Space Complexity Classes<\/p>\n<p><strong>OBJECTIVES<\/strong><\/p>\n<p>This course will introduce Turing Machines as a model of computation and will study classes of problems that can or can not be solved by computers (computability theory) and how to classify the computable problems according to how efficiently they can be solved (complexity<br \/>\ntheory). After successful completion of the course, the students are expected to: (i) understand what a model of computation is and understand the main model, (ii) be able to analyze whether a problem may have an algorithmic solution and if it is tractable, and (iii) know the main complexity classes.<\/p>\n<p><strong>PROGRAM<\/strong><\/p>\n<ol>\n<li>Turing Machines and the Church-Turing Thesis<\/li>\n<li>Decidability and Undecidability<\/li>\n<li>Reducibility<\/li>\n<li>Time Complexity Classes<\/li>\n<li>Space Complexity Classes<\/li>\n<li>Intractability<\/li>\n<\/ol>\n<p><strong>EVALUATION<\/strong><\/p>\n<p>Students will be submitted to two partial evaluations during the semester, each evaluation\u00a0 with 40% of the final grade. The other 20% will be obtained through class assignments. At the end of the semester, there will be an exam that can substitute the final score obtained. The possible grades are A (score &gt;= 9.0), B (score &gt;= 7.5 and &lt; 9.0), C (score &gt;= 6.0 and &lt; 7.5), D (failed, scoreb&lt; 6.0) or FF (failed, the student attended less than 75% of the classes).<\/p>\n<p><strong>BIBLIOGRAPHY<\/strong><\/p>\n<p>Sipser, Michael. <em>Introduction to the Theory of Computation<\/em>, Cengage Learning, 2013.<br \/>\nHarel, David. <em>Algorithmics: The Spirit of Computing<\/em>. MIT Press. 2004<br \/>\nFerreira Filho, Wladston. <em>Computer science distilled: learn the art of solving computational problems<\/em>. Code Energy, 2017.<\/p>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>CMP626 &#8211; Theory of Computation Professor: \u00c1lvaro e Henrique Prerequisites: \u2013 Hours: 60 hs Credits: 4 Semesters: First and second semesters Undergraduate Enrollment: \u2013 Page Link: \u2013 SUMMARY Computability Theory: Model of Computation &#8211; Turing Machines. Church-Turing Thesis. Decidability. Reduction. Complexity theory: Time Complexity, Asymptotic analysis, worst-case analysis. Tractability &#8211; Edmond-Cobham Thesis. Time Complexity Classes. [&hellip;]<\/p>\n","protected":false},"author":11,"featured_media":0,"parent":462,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/www.inf.ufrgs.br\/profcomp\/wp-json\/wp\/v2\/pages\/6782"}],"collection":[{"href":"https:\/\/www.inf.ufrgs.br\/profcomp\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.inf.ufrgs.br\/profcomp\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.inf.ufrgs.br\/profcomp\/wp-json\/wp\/v2\/users\/11"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inf.ufrgs.br\/profcomp\/wp-json\/wp\/v2\/comments?post=6782"}],"version-history":[{"count":1,"href":"https:\/\/www.inf.ufrgs.br\/profcomp\/wp-json\/wp\/v2\/pages\/6782\/revisions"}],"predecessor-version":[{"id":6783,"href":"https:\/\/www.inf.ufrgs.br\/profcomp\/wp-json\/wp\/v2\/pages\/6782\/revisions\/6783"}],"up":[{"embeddable":true,"href":"https:\/\/www.inf.ufrgs.br\/profcomp\/wp-json\/wp\/v2\/pages\/462"}],"wp:attachment":[{"href":"https:\/\/www.inf.ufrgs.br\/profcomp\/wp-json\/wp\/v2\/media?parent=6782"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}