Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
Π01 ENCODABILITY AND OMNISCIENT REDUCTIONS BENOIT MONIN AND LUDOVIC PATEY Abstract. A set of integers A is computably encodable if every infinite set of integers has an infinite subset computing A. By a result of Solova
Add to Reading List
Document Date: 2016-03-08 13:28:28
Open Document
File Size: 276,79 KB
Share Result on Facebook
Π01 ENCODABILITY AND OMNISCIENT REDUCTIONS BENOIT MONIN AND LUDOVIC PATEY Abstract. A set of integers A is computably encodable if every infinite set of integers has an infinite subset computing A. By a result of Solova