Nonexistence of program optimizers in several abstract settings-Reference-Cited by-同舟云学术

Nonexistence of program optimizers in several abstract settings

Published:1976-06 Issue:3 Volume:12 Page:368-393
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Alton Donald A.

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference19 articles.

1. D.A.Alton,, Diversity of speed-ups and embeddability in computational complexity, J. Symbolic Logic, to appear. An earlier version appeared as Technical Report 73-01, Department of Computer Science, The University of Iowa, January, 1973, and is available as Report NSF-OCA-GJ-33168-01 (accession number PB-221089) from National Technical Information Service, U.S. Department of Commerce, Springfield, VA. 22151.

2. Non-existence of program optimizers in an abstract setting;Alton,1973

3. Non-existence of program optimizers in an abstract setting;Alton,1974

4. A machine-independent theory of the complexity of recursive functions;Blum;J. Assoc. Comput. Mach.,1967

5. Two types of hierarchy theorems for axiometic complexity classes;Constable,1973

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Juris Hartmanis: Fundamental Contributions to Isomorphism Problems;Complexity Theory Retrospective;1990

2. On the power of recursive optimizers;Theoretical Computer Science;1988-12

3. On recursive optimizers;Lecture Notes in Computer Science;1986

4. Indexings of subrecursive classes;Theoretical Computer Science;1980-07

5. "Natural" complexity measures and time versus memory: Some definitional proposals;Automata, Languages and Programming;1977