exercism / exercism/problem-specifications
Exercise idea: Turing Machines
Open
new exercise idea
- Dominant language
- Ruby
- Stars
- 358
- Forks
- 563
- Avg merge
- 18h 41m
- Merged PRs (30d)
- 2
Description
The idea is that when implementing a Turing machine you are also proving the turing completeness of the language in use. It may also help people understand a little about how mathematical models of computations are conceived.
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.