OpenLogicProject / OpenLogicProject/OpenLogic
Alternate Representability in Q for Recursive Functions
Open
Nobody has claimed this yet.
- Dominant language
- TeX
- Stars
- 1.4k
- Forks
- 288
- PR merge metrics
- No merged PRs in 30d
Description
Jeremy's notes show that a function is representable in Q iff it is computable -- want alternative way that proves this for "recursive" directly without use of CTT.
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
The issue names Jeremy's notes and an existing representability result but no files or tests. Start by locating the relevant discussion and current proof that a function is representable in Q iff it is computable. Done means providing an alternative direct proof for recursive functions without using CTT.
Written by the indexing model from the issue text.
Assessment
- Domain
- documentation
- Issue type
- Documentation
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100