Authors: DOWNEY R LAFORTE G NIES A

Citation: R. Downey et al., COMPUTABLY ENUMERABLE SETS AND QUASI-REDUCIBILITY, Annals of pure and applied Logic, 95(1-3), 1998, pp. 1-35

Authors: LAFORTE G HAYES PJ FORD KM

Citation: G. Laforte et al., WHY GODEL THEOREM CANNOT REFUTE COMPUTATIONALISM, Artificial intelligence, 104(1-2), 1998, pp. 265-286