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.
New to topics? Read the docs here!