Definitionintro
Computable function
Also called recursive function, effectively computable function.
A partial function computed by some Turing machine.
A partial function computed by some Turing machine.
Where this leads
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag KAXFCE Edit this page History Report an error