随笔分类 -  #理论-计算性与复杂度

摘要:PSPACE, NPSPACE, L, NL, coNL Source: CoCo lecture, UCPH, DIKU, 2021; Introduction to the theory of computation, Michael Sipser, 3rd edition 阅读全文
posted @ 2021-03-26 20:37 romaLzhih 阅读(79) 评论(0) 推荐(0) 编辑
摘要:P;NP;NP-complete Source: CoCo lecture, UCPH, DIKU, 2021; Introduction to the theory of computation, Michael Sipser, 3rd edition 阅读全文
posted @ 2021-03-26 20:35 romaLzhih 阅读(81) 评论(0) 推荐(0) 编辑
摘要:Recursion theorem + logical theories + Turing reducibility + descriptive complexity Source: CoCo lecture, UCPH, DIKU, 2021; Introduction to the theory 阅读全文
posted @ 2021-03-08 09:40 romaLzhih 阅读(114) 评论(0) 推荐(0) 编辑
摘要:Source: Introduction to the theory of computation, Michael Sisper. CoCo Lecture, UCPH, DIKU, 2021 阅读全文
posted @ 2021-03-02 06:12 romaLzhih 阅读(114) 评论(0) 推荐(0) 编辑
摘要:Source: decidable language, lecture, CoCo, UCPH, DIKU, 2021. Introduction of Theory of computation, Michael Sipser. 阅读全文
posted @ 2021-02-25 07:26 romaLzhih 阅读(78) 评论(0) 推荐(0) 编辑
摘要:Context-Free Language Most compilers and interpreters contain a component called a parser that extracts the meaning of a program prior to generating t 阅读全文
posted @ 2021-02-25 07:22 romaLzhih 阅读(363) 评论(0) 推荐(0) 编辑
摘要:Turing Machine Alan Turning, 1936, Turing Machine. A Turing machine can do everything that a real computer can be. Nonetheless, even a Turing machine 阅读全文
posted @ 2021-02-25 07:22 romaLzhih 阅读(535) 评论(0) 推荐(0) 编辑
摘要:Regular Languages Finite Automata Finite automata are good models for computers with an extremely limited amount of memory. The controller moves from 阅读全文
posted @ 2021-02-25 07:21 romaLzhih 阅读(126) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示