We pretty much characteristized human intelligence from computing point of view. We may classify intelligence as oracle. The famous P vs NP is essentially asking if it is the same hard to find the solution of a problem as to verify a given solution.
A huge amount of NP-complete problems found in ...
搜索找到 4 个匹配
- 2025年 1月 31日 21:25
- 版面: STEM
- 主题: Computational Complexity: Classic and Quantum
- 回复总数: 6
- 阅读次数: 515
- 2025年 1月 29日 18:41
- 版面: STEM
- 主题: Computational Complexity: Classic and Quantum
- 回复总数: 6
- 阅读次数: 515
Re: Computational Complexity: Classic and Quantum
We may define intelligence as efficiently expressing from information point of view. So far we have barely or not see new knowledge created by AI. We have some kind of deep understanding of our reasoning(formal) but there could be something new in Deep learning and Big data which could indicate that ...
- 2025年 1月 29日 09:34
- 版面: STEM
- 主题: Computational Complexity: Classic and Quantum
- 回复总数: 6
- 阅读次数: 515
Re: Computational Complexity: Classic and Quantum
The last few slides shined some point of views of human intelligence and may help us to understand AI and its current level.
- 2025年 1月 28日 23:01
- 版面: STEM
- 主题: Computational Complexity: Classic and Quantum
- 回复总数: 6
- 阅读次数: 515
Computational Complexity: Classic and Quantum
Some interesting slides
https://github.com/yong-yao/quantum-computing/blob/main/A%20Tour%20to%20Computational%20Complexity.pdf
Computational Complexity: Classic and Quantum
What is computing? Now we have Turing machine as the answer of this question and we believe it is the right answer. We turned ...
https://github.com/yong-yao/quantum-computing/blob/main/A%20Tour%20to%20Computational%20Complexity.pdf
Computational Complexity: Classic and Quantum
What is computing? Now we have Turing machine as the answer of this question and we believe it is the right answer. We turned ...