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
A partial function is computable when a program returns its value on every input in its domain and runs forever on inputs outside its domain.
In computer science and mathematical logic, a **computable function** refers to a function whose output can be determined by an effective algorithm or procedure.