首页 | 本学科首页   官方微博 | 高级检索  
     


A New Reducibility between Turing- and wtt-Reducibility
Authors:Sui Yuefei
Abstract:A new reducibility between Turing and weak truth-table reducibility is defined, which gives an affirmative answer to the open question about the existence of such an intermediate reducibility proposed formally by M. Stob. Mathematics Subject Classification: 03D25.
Keywords:Turing reducibility  wtt-reducibility  Recursively enumerable set
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号