andy
be05b7905d
Affected files: .obsidian/community-plugins.json .obsidian/graph.json .obsidian/plugins/table-editor-obsidian/data.json .obsidian/plugins/table-editor-obsidian/main.js .obsidian/plugins/table-editor-obsidian/manifest.json .obsidian/plugins/table-editor-obsidian/styles.css .obsidian/workspace.json Charities.md Health/BWS.md History/Britain.md Lab/DNS.md Lab/Deleted Packages.md Lab/Ebook Laundering.md Lab/Home.md Lab/Mac.md Lab/Photo Migration.md Languages/Arabic.md Money/Assets/Derivative.md Money/Assets/Financial Instruments.md Money/Assets/Security.md Money/Econ.md Money/Equity.md Money/Giving.md Money/Markets/Commodity.md Money/Markets/Markets.md Money/Markets/Types.md STEM/AI/Literature.md STEM/AI/Properties.md STEM/CS/ABI.md STEM/CS/Code Types.md STEM/CS/Compilers.md STEM/CS/Language Binding.md STEM/CS/Languages/dotNet.md STEM/CS/Quantum.md STEM/CS/Resources.md STEM/CS/Turing Machines.md STEM/Maths/Algebra.md STEM/Semiconductors/Equations.md STEM/Signal Proc/Convolution.md STEM/Signal Proc/Fourier Transform.md STEM/Speech/Literature.md STEM/img/ai-io.png STEM/img/ai-nested-subjects.png STEM/img/cli-infrastructure.png Tattoo/Plans.md Tattoo/img/chest.png
720 B
720 B
David Hilbert
- Wondered if there was a universal algorithmic process to decide whether any mathematical proposition was true
- Then suggested that there were no unsolvable problems
Incompleteness Theorem
Kurt Godel
You might be able to prove every conceivable statement about numbers within a system by going outside the system in order to come up with new rules and axioms, but by doing so you'll only create a larger system with its own unprovable statements
Turing Machine
- Model of computation
- Resolves whether or not mathematics contained problems were incomputable
- No algorithmic solution
Church-Turing Thesis
Any algorithm capable of being devised can be run on a Turing machine