The prototypical example is the Busy beaver function, which is the easiest example to reach from the halting problem.
Articles by others on the same topic
In computer science and mathematical logic, a **computable function** refers to a function whose output can be determined by an effective algorithm or procedure.