Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Axioms for time dependence of resource consumption in computing recursive functions

Axioms for time dependence of resource consumption in computing recursive functions Any formal definition of effective computability includes the idea of graduality of computation: whether it is a matter of Markov's algorithms (ANM) or of Turing Machines (TM) or of any other equivalent mathematical system, the elaboration progresses by discrete and successive instants. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGACT News Association for Computing Machinery

Axioms for time dependence of resource consumption in computing recursive functions

Longo, Giuseppe
ACM SIGACT News , Volume (12) – Jul 1, 1969
Download PDF
11 pages

Loading next page...
 
/lp/association-for-computing-machinery/axioms-for-time-dependence-of-resource-consumption-in-computing-v7HOrGycUj

References (2)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1969 by ACM Inc.
ISSN
0163-5700
DOI
10.1145/1247036.1247037
Publisher site
See Article on Publisher Site

Abstract

Any formal definition of effective computability includes the idea of graduality of computation: whether it is a matter of Markov's algorithms (ANM) or of Turing Machines (TM) or of any other equivalent mathematical system, the elaboration progresses by discrete and successive instants.

Journal

ACM SIGACT News – Association for Computing Machinery

Published: Jul 1, 1969

There are no references for this article.