OpenLogicProject / OpenLogicProject/OpenLogic
Turing machine continuity w/ other definitions
Nobody has claimed this yet.
- Dominant language
- TeX
- Stars
- 1.4k
- Forks
- 288
- PR merge metrics
- No merged PRs in 30d
Description
Hi all! Sipser (and other TOC sources) use a 7-tuple definition of a turing machine:
- Start State
- Reject State
- Accept state
- Transition function
- Tape Alphabet
- Input alphabet
- Set of states
The open logic chapter on computation, in contrast, uses a 4-tuple definition. Is there a reason for this (maybe a difference in philosophy/computer science's respective disciplinary norms?) or should I (or someone else) rewrite the definition using the more conventional 7-tuple?
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start with the Open Logic chapter on computation and compare its 4-tuple Turing machine definition with the 7-tuple convention described in the issue. Document the reason for the difference or revise the definition, with the chapter's explanation and terminology made consistent.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- tex
- Domain
- documentation
- Issue type
- Documentation
- Difficulty
- 2/5
- Estimated time
- 1-3 hours
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100