递归理论中的有界查询:综述

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1991-06-30 DOI:10.1109/SCT.1991.160245

W. Gasarch

{"title":"递归理论中的有界查询:综述","authors":"W. Gasarch","doi":"10.1109/SCT.1991.160245","DOIUrl":null,"url":null,"abstract":"The author surveys much of the work that has been done on the following two questions: (1) What functions can one compute with m queries to A? and (2) Are there functions that can be computed with m queries to A that cannot be computed with m-1 queries to A? To any set X? The framework is recursion-theoretic; the computations have no time or space bound.<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"05 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":"{\"title\":\"Bounded queries in recursion theory: a survey\",\"authors\":\"W. Gasarch\",\"doi\":\"10.1109/SCT.1991.160245\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The author surveys much of the work that has been done on the following two questions: (1) What functions can one compute with m queries to A? and (2) Are there functions that can be computed with m queries to A that cannot be computed with m-1 queries to A? To any set X? The framework is recursion-theoretic; the computations have no time or space bound.<<ETX>>\",\"PeriodicalId\":158682,\"journal\":{\"name\":\"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference\",\"volume\":\"05 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"30\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCT.1991.160245\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1991.160245","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 30

摘要

作者调查了在以下两个问题上所做的大量工作:(1)对A进行m次查询可以计算出什么函数?(2)是否存在对A进行m次查询可以计算而对A进行m-1次查询不能计算的函数?对任意集合X?框架是递归理论的;计算不受时间和空间的限制。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Bounded queries in recursion theory: a survey

The author surveys much of the work that has been done on the following two questions: (1) What functions can one compute with m queries to A? and (2) Are there functions that can be computed with m queries to A that cannot be computed with m-1 queries to A? To any set X? The framework is recursion-theoretic; the computations have no time or space bound.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference

自引率

0.00%

发文量