CS 4510 Chapter Notes - Chapter 0: Automata Theory, Computability Theory, Binary Relation

27 views8 pages
26 Mar 2021
Course
Professor

Document Summary

Yet (cid:8869) automata , computability , & complexity interpreted differently based on which aspect you focus on . (cid:12200)(cid:12200) complexity theory. What makes some problems computationally hard & others easy ? (cid:8869) apparently nobody fucking knows lmao. Some problems are only hard in the worst case scenario you could be fine w/ a program that"s slow on occasion (cid:8869) but easy most of the time . Consider alternative types of computation , i. e . randomized computation . A complexity theory on nicety affects fields like cryptography . (cid:8869) weirdly , you want hard computational problems > easy ones . for things like codes & passwords . Some certain basic problems can "t be solved by computers . Es ex . determining whether or nor a mathematical statement is tif . This realization led to the development of ideas conceiving theoretical models of computers which led to the actual areatrim of computers .

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related Documents

Related Questions