Recursively enumerable set

From Free net encyclopedia

(Latest | Earliest) View (previous 50) (next 50) (20 | 50 | 100 | 250 | 500).

To view a previous version, click the date for that version. Legend: (cur) = difference with current version, (last) = difference with preceding version, m = minor edit

• (cur) (last) 05:55, 6 April 2006 JRSpriggs (→Examples - Given a function f, the graph of f, i.e. {(x,f(x))|x in the domain of f}, is recursively enumerable iff f is partial recursive.)

(Latest | Earliest) View (previous 50) (next 50) (20 | 50 | 100 | 250 | 500).