https://github.com/dideler/theory-of-computation
Solutions to assigned problems
https://github.com/dideler/theory-of-computation
Last synced: 5 months ago
JSON representation
Solutions to assigned problems
- Host: GitHub
- URL: https://github.com/dideler/theory-of-computation
- Owner: dideler
- Created: 2011-11-19T15:23:31.000Z (over 14 years ago)
- Default Branch: master
- Last Pushed: 2011-12-14T23:48:33.000Z (over 14 years ago)
- Last Synced: 2023-03-12T03:52:45.244Z (over 3 years ago)
- Homepage:
- Size: 104 KB
- Stars: 1
- Watchers: 2
- Forks: 1
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
Theory of Computation -- or -- Computability Theory
===================================================
Background
----------
This study of this material stands at the intersection of three fields:
1. mathematics
2. theoretical computer science
3. philosophy
In terms of mathematics
-----------------------
Mathematically, computability theory originates from the concept of an *algorithm*.
It leads to a classification of functions according to their inherent *complexity*.
In terms of computer science
----------------------------
For the computer scientist, computability theory shows that quite apart from practical matters of running time
and memory space, there is a purely theoretical limit to what computer programs can do.
This is an important fact, and leads to the questions:
* Where is the limit?
* What is on this side of the limit?
* What lies beyond it?
In terms of philosophy
----------------------
Computability is relevant to the philosophy of mathematics and, in particular, to the questions:
* What *is* a proof?
* Does every true sentence have a proof?
* What is infinity?
* What is computable, and similarly, what is unsolvable?
Extras
------
Cheat sheet available on OpenCSC: https://github.com/BrockCSC/cheat-sheets
Disclaimer: I cannot guarantee that these solutions are correct, use at your own risk.