SIGN IN
SIGN UP
Classes of computable functions defined by bounds on computation: Preliminary Report
Full Text:
PDF
Buy this Article
Authors:
E. M. McCreight
Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Pa
A. R. Meyer
Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Pa
Published in:
· Proceeding
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Pages 79-88
ACM
New York, NY
, USA
©1969
table of contents
doi>
10.1145/800169.805423
1969 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 16
· Downloads (cumulative): 266
· Citation Count: 23
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
bounded-action devices
languages
measurement
recursive function theory
relations among complexity classes
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder