Lukas' Notes

Definition

Decidable Set

A set is decidable, or recursive, if its indicator function

is total computable. A program must halt on every input , returning if and otherwise. Unlike semi-decidability, termination is required also for inputs outside .