Predictable consequence

In the computability theory , a branch of theoretical computer science and mathematical logic , there are computable consequences .

definition

A sequence with is called computable if and only if there is a computable function with . ${\displaystyle a_{i}\in A,i\in B}$ ${\displaystyle f\colon B\to A}$ ${\displaystyle f(i)=a_{i}}$

See also

• Recursive enumerability