Axioms for time dependence of resource consumption in computing recursive functions

  • Authors:

  • Giuseppe Longo

  • Affiliations:

  • University of Pisa -- Italy

  • Venue:
  • ACM SIGACT News
  • Year:
  • 1969

Quantified Score

Hi-index 0.00

Visualization

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.