Alternate Representability in Q for Recursive Functions
Nobody has claimed this yet.
Assessment
- Difficulty
- 5/5
- Estimated time
- Over a week
- Newbie friendliness
- 20/100
- Issue type
- Documentation
- Clarity
- Needs clarification
- Activity status
- Stale
- Domain
- documentation
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.
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.
- Dominant language
- TeX
- Stars
- 1.4k
- Forks
- 289
- PR merge metrics
- No merged PRs in 30d
Getting set up
This project ships no dev container, Dockerfile or contributing guide, so setting up is up to you: start from its README, and see our first-contribution guide for the general steps.
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.
More from OpenLogicProject/OpenLogic
-
Difficulty 1/5 Under an hour Newbie friendliness 65/100
OpenLogicProject/OpenLogic#339 · 1 comment ·
-
Difficulty 4/5 3-5 days Newbie friendliness 50/100
OpenLogicProject/OpenLogic#436 ·
-
Difficulty 3/5 1-2 days Newbie friendliness 68/100
OpenLogicProject/OpenLogic#435 · 1 comment ·
-
Difficulty 5/5 Over a week Newbie friendliness 30/100
OpenLogicProject/OpenLogic#425 · 1 comment ·
-
Improve docsOpen
Difficulty 5/5 Over a week Newbie friendliness 25/100
OpenLogicProject/OpenLogic#390 ·
All issues in OpenLogicProject/OpenLogic
Similar issues
-
Difficulty 1/5 Under an hour Newbie friendliness 82/100
siyuan-note/siyuan#20313 ·
Maintainers usually reply within 1 day
-
Difficulty 1/5 1-3 hours Newbie friendliness 82/100
Maintainers usually reply within 1 day
-
Difficulty 1/5 Under an hour Newbie friendliness 76/100
ethereum/execution-apis#935 ·
Maintainers usually reply within 1 day
-
Difficulty 1/5 1-3 hours Newbie friendliness 88/100
infinispan/langchain-infinispan#34 ·
Maintainers usually reply within 1 day
-
[docs] Media elements cannot load from a custom protocol (video/audio report MEDIA_ERR_SRC_NOT_SUPPORTED)Possibly taken @vst93 claimed this today. Open
Difficulty 2/5 1-3 hours Newbie friendliness 68/100
Maintainers usually reply within 1 day