{"id":"palomar/PALOMAR-2026-11-01-000026","url":"https://github.com/Arthur742Ramos/Math-Formalization/tree/0160b1ea1af92434ad40e27f2fe84e4ea837a026/lambda-turing","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-01-000026-v1.json","repo":"https://github.com/Arthur742Ramos/Math-Formalization","tags":["math.LO","cs.LO"],"score":0,"title":"Full beta lambda calculus and finite Turing machine computability","trust":"high","domain":"math.LO","source":"palomar","authors":["Arthur Freitas Ramos","David Barros Hulak","Ruy José Guerra Barretto de Queiroz"],"reviews":0,"subject":"math.LO","summary":"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.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-01","reactions":{},"formalized":true}