Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
96
click to vote
LFCS
1992
Springer
87
views
Artificial Intelligence
»
more
LFCS 1992
»
Banishing Robust Turing Completeness
15 years 7 months ago
Download
www.comp.nus.edu.sg
This paper proves that "promise classes" are so fragilely structured that they do not robustly (i.e. with respect to all oracles) possess Turinghard sets even in classes...
Lane A. Hemachandra, Sanjay Jain, Nikolai K. Veres...
claim paper
Read More »