Delphi.science

Full beta lambda calculus and finite Turing machine computability

Source: github.com/Arthur742Ramos/Math-Formalization/tree/0160b1ea1…

Arthur Freitas Ramos, David Barros Hulak, Ruy José Guerra Barretto de Queiroz

Palomar Registrypalomar/PALOMAR-2026-11-01-000026Nov 1, 2026math.LOscore 0

Closed untyped de Bruijn lambda terms under full beta reachability of Church numerals compute exactly the unary partial numerical functions computed by finite three-symbol unary Turing machines. The package defines translations in both directions and proves pointwise numerical-result and no-result equivalences.

RepositoryJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-01-000026
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-01-000026/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-01-000026/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'