Re:Foundations of Computer Science
by RockyMcNuts on Tuesday June 25, 2013 @07:39AM
(#5938720)
mostly kidding. but presumably the theorems about non-computable numbers are computable and therefore you're still working with computable things?
EX: computable numbers are a subset of all numbers. http://en.wikipedia.org/wiki/Computable_number