发布求助
文献互助 智能选刊 最新文献

Proceedings of the fourth annual ACM symposium on Theory of computing最新文献

筛选
英文 中文
On the additions necessary to compute certain functions 关于计算某些函数所必需的加法
Proceedings of the fourth annual ACM symposium on Theory of computing Pub Date : 1972-05-01 DOI: 10.1145/800152.804901
D. Kirkpatrick
{"title":"On the additions necessary to compute certain functions","authors":"D. Kirkpatrick","doi":"10.1145/800152.804901","DOIUrl":"https://doi.org/10.1145/800152.804901","url":null,"abstract":"We introduce a theoretical notion, strongly related to algebraic independence, which can be applied to the terms of any computable expression to derive a lower bound on the number of additions and subtractions required to compute that expression.","PeriodicalId":229726,"journal":{"name":"Proceedings of the fourth annual ACM symposium on Theory of computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1972-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132141694","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Worst-case analysis of memory allocation algorithms 内存分配算法的最坏情况分析
Proceedings of the fourth annual ACM symposium on Theory of computing Pub Date : 1972-05-01 DOI: 10.1145/800152.804907
M. Garey, R. Graham, J. Ullman
{"title":"Worst-case analysis of memory allocation algorithms","authors":"M. Garey, R. Graham, J. Ullman","doi":"10.1145/800152.804907","DOIUrl":"https://doi.org/10.1145/800152.804907","url":null,"abstract":"Various memory allocation problems can be modeled by the following abstract problem. Given a list A = (&agr;1,&agr;2,...&agr;n,) of real numbers in the range (0, 1], place these in a minimum number of “bins” so that no bin holds numbers summing to more than 1. We let A* be the smallest number of bins into which the numbers of list A may be placed. Since a general placement algorithm for attaining A* appears to be impractical, it is important to determine good heuristic methods for assigning numbers of bins. We consider four such simple methods and analyze the worst-case performance of each, closely bounding the maximum of the ratio of the number of bins used by each method applied to list A to the optimal quantity A*.","PeriodicalId":229726,"journal":{"name":"Proceedings of the fourth annual ACM symposium on Theory of computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1972-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134646289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 184
Time-bounded random access machines 限时随机存取机
Proceedings of the fourth annual ACM symposium on Theory of computing Pub Date : 1972-05-01 DOI: 10.1145/800152.804898
S. Cook, R. Reckhow
{"title":"Time-bounded random access machines","authors":"S. Cook, R. Reckhow","doi":"10.1145/800152.804898","DOIUrl":"https://doi.org/10.1145/800152.804898","url":null,"abstract":"In this paper we introduce a formal model for random access computers and argue that the model is a good one to use in the theory of computational complexity. Results are proved which compare run times for recognizing sets using this model (which has a fixed program) with a stored program model and with Turing machines. The main result, theorem 3, shows the existence of a time complexity hierarchy which is finer than that of any standard abstract computer model. An Algol-like programming language is introduced which facilitates proofs of the theorems.","PeriodicalId":229726,"journal":{"name":"Proceedings of the fourth annual ACM symposium on Theory of computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1972-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127043111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 270
Uniformly erasable AFL 均匀可擦除的AFL
Proceedings of the fourth annual ACM symposium on Theory of computing Pub Date : 1972-05-01 DOI: 10.1145/800152.804916
S. Ginsburg, Jonathan Goldstine, S. Greibach
{"title":"Uniformly erasable AFL","authors":"S. Ginsburg, Jonathan Goldstine, S. Greibach","doi":"10.1145/800152.804916","DOIUrl":"https://doi.org/10.1145/800152.804916","url":null,"abstract":"The purpose of this paper is to show that a number of well-known families have property (*). In particular, we prove that the family of context-free languages does indeed have this property. In addition, we show that several familiar subfamilies of the context-free languages, such as the one-counter languages, have property (*). Finally, we show that there are families satisfying (*) which are not subfamilies of the context-free languages, for we prove that any family generated from one-letter languages has property (*), thereby extending a result of [17].","PeriodicalId":229726,"journal":{"name":"Proceedings of the fourth annual ACM symposium on Theory of computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1972-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114518425","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 23
Rapid identification of repeated patterns in strings, trees and arrays 快速识别字符串、树和数组中的重复模式
Proceedings of the fourth annual ACM symposium on Theory of computing Pub Date : 1972-05-01 DOI: 10.1145/800152.804905
R. Karp, Raymond E. Miller, A. Rosenberg
{"title":"Rapid identification of repeated patterns in strings, trees and arrays","authors":"R. Karp, Raymond E. Miller, A. Rosenberg","doi":"10.1145/800152.804905","DOIUrl":"https://doi.org/10.1145/800152.804905","url":null,"abstract":"In this paper we look at a number of matching problems and devise general techniques for attacking such problems. In particular, we describe a strategy for constructing efficient algorithms for solving two types of matching problems. We use this strategy to develop explicit algorithms for these two problems applied to strings (where the patterns are substrings) and arrays (where the patterns are subarrays or blocks). We also develop algorithms for these and related problems for trees, where the patterns are subtrees. Certain special cases of these algorithms are also discussed. Although we do not claim that these algorithms are optimal, we analyze each algorithm to estimate its computational cost. This provides some basis for choosing which algorithm is most desirable in any given situation.","PeriodicalId":229726,"journal":{"name":"Proceedings of the fourth annual ACM symposium on Theory of computing","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1972-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127267789","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 320
Flowchart schemata with counters 带有计数器的流程图示意图
Proceedings of the fourth annual ACM symposium on Theory of computing Pub Date : 1972-05-01 DOI: 10.1145/800152.804895
D. Plaisted
{"title":"Flowchart schemata with counters","authors":"D. Plaisted","doi":"10.1145/800152.804895","DOIUrl":"https://doi.org/10.1145/800152.804895","url":null,"abstract":"The translation of a specific flowchart schema with one counter into an equivalent flowchart schema without counters is described. This result leads easily to the general translation method from one-counter flowchart schemata to zero-counter flowchart schemata. Some generalizations are then presented.","PeriodicalId":229726,"journal":{"name":"Proceedings of the fourth annual ACM symposium on Theory of computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1972-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122803607","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
A patent problem for abstract programming languages; machine-independent computations 抽象程序设计语言的专利问题;与机器无关的计算
Proceedings of the fourth annual ACM symposium on Theory of computing Pub Date : 1972-05-01 DOI: 10.1145/800152.804914
R. Hamlet
{"title":"A patent problem for abstract programming languages; machine-independent computations","authors":"R. Hamlet","doi":"10.1145/800152.804914","DOIUrl":"https://doi.org/10.1145/800152.804914","url":null,"abstract":"A programming language may be viewed as an acceptable numbering of the partial recursive functions, with “semantics” the mapping from programs onto the functions computed [1]. (In this view, syntax receives little attention, although it is best to consider it as a characteristic function of a recursive set of indices instead of allowing all natural numbers. Such a view is natural for the usual arithmetizations, and eliminates some possible confusions, for example in interpreting the recursion theorem for pairs of numberings.) The virtue of functional semantics is that the semantic range is a machine-independent class. The abstract view in which details of the semantic mapping are ignored, in which the function assigned to a program is “the one it computes,” with the enumeration and s-m-n theorems assumed to compensate for the lost detail, has found only a restricted application to programning-language problems. Computational complexity, in the successful abstraction by Blum [2], is an attempt to provide more semantic structure without introducing a tenacious machine-dependence. The Blum measures are not themselves suitable as a semantic range. Two programs may have the same measure function, yet compute wildly different functions in widly different ways; other programs, intuitively very similar, may have wildly different measure functions [3]. A composite semantics of a function computed and a measure function is much like the approach suggested here: using formal computation functions as the semantic range.","PeriodicalId":229726,"journal":{"name":"Proceedings of the fourth annual ACM symposium on Theory of computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1972-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115899312","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Program size and economy of descriptions: Preliminary Report 项目规模和经济描述:初步报告
Proceedings of the fourth annual ACM symposium on Theory of computing Pub Date : 1972-05-01 DOI: 10.1145/800152.804912
A. Meyer, A. Bagchi
{"title":"Program size and economy of descriptions: Preliminary Report","authors":"A. Meyer, A. Bagchi","doi":"10.1145/800152.804912","DOIUrl":"https://doi.org/10.1145/800152.804912","url":null,"abstract":"Restricted programming languages, for example primitive recursive definition schemes, are very often not nearly as succinct in describing primitive recursive functions as a general programming language [1]. We show that as one increases the power of programming languages, one can obtain economies in program size by any recursive amount for even very simple functions. This parallels a situation in the arithmetic hierarchy, where it is possible to get a recursively enumerable set whose smallest recursively enumerable index is much larger than the smallest index for the same set considered, say, as a set recursively enumerable in ø'. These phenomena follow from the fact that the ability to write programs which refer to the universal functions of an enumeration enables one to decrease significantly the size of programs. The notation, when not defined is that of [4].","PeriodicalId":229726,"journal":{"name":"Proceedings of the fourth annual ACM symposium on Theory of computing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1972-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121752869","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Predecessor machines and regressing functions 前导机和回归功能
Proceedings of the fourth annual ACM symposium on Theory of computing Pub Date : 1972-05-01 DOI: 10.1145/800152.804899
John C. Warkentin, P. C. Fischer
{"title":"Predecessor machines and regressing functions","authors":"John C. Warkentin, P. C. Fischer","doi":"10.1145/800152.804899","DOIUrl":"https://doi.org/10.1145/800152.804899","url":null,"abstract":"A predecessor machine is a random-access machine with a predecessor operation (i.e., an instruction which subtracts 1 from the contents of a memory cell), but with no operation which can increase the contents of a cell. A regressing function is a total function which never yields an output larger than the maximum of its inputs and a constant. Unlike the situation for random-access machines with a successor operation, it does not matter whether or not predecessor machines with loop control also have conditional transfer instructions. Furthermore, the class of functions computable by predecessor loop machines consists of exactly those regressing functions which are computable by a deterministic linear-bounded automaton. Some generalized predecessor machines are also considered.","PeriodicalId":229726,"journal":{"name":"Proceedings of the fourth annual ACM symposium on Theory of computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1972-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115344769","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
The process complexity and effective random tests. 过程复杂，随机测试有效。
Proceedings of the fourth annual ACM symposium on Theory of computing Pub Date : 1972-05-01 DOI: 10.1145/800152.804910
C. Schnorr
{"title":"The process complexity and effective random tests.","authors":"C. Schnorr","doi":"10.1145/800152.804910","DOIUrl":"https://doi.org/10.1145/800152.804910","url":null,"abstract":"We propose a variant of the Kolmogorov concept of complexity which yields a common theory of finite and infinite random sequences. The process complexity does not oscillate. We establish some concepts of effective tests which are proved to be equivalent.","PeriodicalId":229726,"journal":{"name":"Proceedings of the fourth annual ACM symposium on Theory of computing","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1972-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116991041","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 169
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信