ON COMPUTATIONAL SPEED-UP,

Abstract

The 'operator speed up' in this paper establishes the existence of a computable function f such that for any program computing f(x) in a number of steps for all x, there is another program computing f(x) in a smaller number of steps. An example of speed up for Turing machines is considered.

Document Details

Document Type
Technical Report
Publication Date
May 01, 1968
Accession Number
AD0670544

Entities

People

  • Albert R. Meyer
  • Patrick C. Fischer

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Automata
  • Behavior And Behavior Mechanisms
  • Behavioral Disciplines And Activities
  • Behavioral Sciences
  • British Columbia
  • Canada
  • Continents
  • Cooperation
  • Geographic Regions
  • Group Dynamics
  • Machines

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Analytical Mechanics
  • Computational Fluid Dynamics (CFD)
  • Mathematical Modeling and Probability Theory.