Theory of computing

Regular Expressions/DFA/NFA

Regular Expressions (RE) 正规式
它的规则：
https://www.runoob.com/regexp/regexp-metachar.html
(测试网站）：
https://tool.oschina.net/regex/

Finite State Machine:(有限状态机）
Finite Automaton：（有穷自动机）
DFA/NFA：确定的又穷自动机/非确定的有穷自动机

Two ways to define a set of strings (language)：

Regular expressions (REs)
Deterministic finite automatia (DFAs)

conclusion：

1. Remarkable fact. DFAs and REs are equivalent (等价）
2. In short, there is no formal language that can be recognized by some NFA and not by any DFA
3. NFAs and REs are equivalent
4. Not all formal languages are regular

Turing Machines

DFAs 与 TMs的比较

Universality

All computational devices are equivalent
Turing as a definition of what we can compute
Q&A ： 图灵机,Java,mobile phone,are universality

Computability

根据前面的理论如果问题不能计算那么所有的计算机都不能计算因为
All computational devices are equivalent
The halting problem is undecidable: (图灵机停机问题）https://zhidao.baidu.com/question/22004860.html