De Bruijn index: Difference between revisions
Jump to navigation
Jump to search
Added Category:Functions |
Updated champion 21 |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
'''De Bruijn index''' is an alternative method to represent lambda calculus expressions. | '''De Bruijn index''' is an alternative method to represent [[lambda calculus]] expressions. | ||
Its attendant Busy Beaver problem is '''BBλ_db''' which uses De Bruijn index instead of binary to evaluate lambda calculus expression size. To calculate size, convert the lambda calculus expression into [[wikipedia:De_Bruijn_index|De Bruijn index]], then count the number of backslashes (lambdas) and numbers. By example, <code>(\1 1) (\\2 (1 2))</code> is size 8 because it has 3 backslashes and 5 numbers. | Its attendant Busy Beaver problem is '''BBλ_db''' which uses De Bruijn index instead of binary to evaluate lambda calculus expression size. To calculate size, convert the lambda calculus expression into [[wikipedia:De_Bruijn_index|De Bruijn index]], then count the number of backslashes (lambdas) and numbers. By example, <code>(\1 1) (\\2 (1 2))</code> is size 8 because it has 3 backslashes and 5 numbers. | ||
| Line 59: | Line 59: | ||
|<code>(\1 1 1) (\1 (1 (\\\1 3 2 (\\2 (2 1)))))</code> | |<code>(\1 1 1) (\1 (1 (\\\1 3 2 (\\2 (2 1)))))</code> | ||
|50_ft_lock | |50_ft_lock | ||
|- | |||
|19 | |||
|<math>> f_{\omega^\omega2}(f^2_{\omega^\omega}(3))</math> | |||
|<code>(\1 1 (\1 (\\\1 3 2 5) 2) 1) (\\2 (2 1)))</code> | |||
|Gustavo Melo & 50_ft_lock & Sam Bolsover | |||
|- | |||
|20 | |||
|<math>> f_{\omega^\omega2+1}(7)</math> | |||
|<code>(\1 1 1 (\1 (\\\1 3 2 5) 2) 1) (\\2 (2 1)))</code> | |||
|Gustavo Melo & 50_ft_lock & Sam Bolsover | |||
|- | |||
|21 | |||
|<math>> f_{\omega^{\omega^{2}+\omega+2}}(2)</math> | |||
|<code>(\1 1 (\\\\1 4 3 2 1) 1 1 1 1) (\\2 (2 1))</code> | |||
| | |||
|- | |- | ||
|22 | |22 | ||
|<math>> f_{\omega^{\omega | |<math>> f_{\omega^{\omega^{14}}}(2)</math> | ||
|<code>(\1 (\\\\1 | |<code>(\1 1 1 (\\\\1 4 3 2 1) 1 1 1 1) (\\2 (2 1))</code> | ||
| | | | ||
|- | |- | ||
|23 | |23 | ||
Latest revision as of 07:04, 17 October 2026
De Bruijn index is an alternative method to represent lambda calculus expressions.
Its attendant Busy Beaver problem is BBλ_db which uses De Bruijn index instead of binary to evaluate lambda calculus expression size. To calculate size, convert the lambda calculus expression into De Bruijn index, then count the number of backslashes (lambdas) and numbers. By example, (\1 1) (\\2 (1 2)) is size 8 because it has 3 backslashes and 5 numbers.
For n < 7, BBλ_db(n) = n is trivial and can be achieved via picking any size n term already in normal form (like BBλ(m) for m ≤ 20).
| BBλ_db(n) | Value | Champion | Discovered By |
|---|---|---|---|
| 7 | ≥ 7 | \1 1 1 1 1 1
|
|
| 8 | ≥ 16 | (\1 1) (\\2 (1 2))
|
Azerty & John Tromp & Bertram Felgenhauer |
| 9 | ≥ 68 | (\1 1) (\\2 (2 (1 2)))
|
John Tromp & Bertram Felgenhauer |
| 10 | (\1 1 1) (\\2 (2 (2 1)))
|
||
| 11 | (\1 1 1 1) (\\2 (2 (2 1)))
|
||
| 12 | (\1 1 1) (\1 (\\2 (2 1)) 1)
|
mxdys and racheline | |
| 13 | (\1 1) (\1 (\1 (\\2 (2 1)) 2))
|
mxdys | |
| 14 | (\1 1 1) (\\1 (1 2) (\\2 (2 1)))
|
50_ft_lock | |
| 15 | (\1 1) (\1 (1 (\\1 2 (\\2 (2 1)))))
|
Gustavo Melo | |
| 18 | (\1 1 1) (\1 (1 (\\\1 3 2 (\\2 (2 1)))))
|
50_ft_lock | |
| 19 | (\1 1 (\1 (\\\1 3 2 5) 2) 1) (\\2 (2 1)))
|
Gustavo Melo & 50_ft_lock & Sam Bolsover | |
| 20 | (\1 1 1 (\1 (\\\1 3 2 5) 2) 1) (\\2 (2 1)))
|
Gustavo Melo & 50_ft_lock & Sam Bolsover | |
| 21 | (\1 1 (\\\\1 4 3 2 1) 1 1 1 1) (\\2 (2 1))
|
||
| 22 | (\1 1 1 (\\\\1 4 3 2 1) 1 1 1 1) (\\2 (2 1))
|
||
| 23 | (\1 1 (\\\\1 4 4 4 3 2 1) 1 1 1 1) (\\2 (2 1))
|
Patcail | |
| 24 | (\1 1 1 (\\\\1 4 4 4 3 2 1) 1 1 1 1) (\\2 (2 1))
|
Patcail | |
| 25 | (\1 (\1 (\\\\1 4 4 4 3 2 1) 1 1 1 1) 1) (\\2 (2 1))
|
Patcail | |
| 26 | (\1 1 (\1 (\\\\1 4 4 4 3 2 1) 1 1 1 1) 1) (\\2 (2 1))
|
Patcail |