A Machine-Independent Theory of the Complexity of Recursive Functions

Authors:
Manuel Blum
Affiliations:
Department of Mathematics and Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, Massachusetts
Venue:
Journal of the ACM (JACM)
Year:
1967

Citing 0
Cited 180

Theory of computation: how to start

ACM SIGACT News
The history and status of the P versus NP question

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On learning limiting programs

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Constant time factors do matter

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Probability is more powerful than team for language identification from positive data

COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On the intrinsic complexity of language identification

COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Characterizing language identification by standardizing operations

Journal of Computer and System Sciences
Turing Award lecture: it's time to reconsider time

Communications of the ACM
Vacillatory learning of nearly minimal size grammars

Journal of Computer and System Sciences
Regular Article: Open problems in “systems that learn”

Proceedings of the 30th IEEE symposium on Foundations of computer science
On computational complexity and the nature of computer science

ACM Computing Surveys (CSUR)
Turing Award lecture on computational complexity and the nature of computer science

Communications of the ACM
Fundamentals of computing (a cheatlist)

ACM SIGACT News
Synthesizing enumeration techniques for language learning

COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Elementary formal systems, intrinsic complexity, and procrastination

COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Aspects of complexity of conservative probabilistic learning

COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
On the intrinsic complexity of learning recursive functions

COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
On the Complexity of Undecidable Problems in Automata Theory

Journal of the ACM (JACM)
Toward a Theory of Enumerations

Journal of the ACM (JACM)
On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers

Journal of the ACM (JACM)
Computational Complexity and Probability Constructions

Journal of the ACM (JACM)
On the Efficiency of Algorithms

Journal of the ACM (JACM)
On Effective Procedures for Speeding Up Algorithms

Journal of the ACM (JACM)
Computational Complexity and the Existence of Complexity Gaps

Journal of the ACM (JACM)
The Operator Gap

Journal of the ACM (JACM)
Recursive Properties of Abstract Complexity Classes

Journal of the ACM (JACM)
Subrecursive Programming Languages, Part I: efficiency and program structure

Journal of the ACM (JACM)
Ordinal Hierarchies and Naming Complexity Classes

Journal of the ACM (JACM)
An Example of Information and Computation Resource Trade-Off

Journal of the ACM (JACM)
On Almost Everywhere Complex Recursive Functions

Journal of the ACM (JACM)
Optimization Among Provably Equivalent Programs

Journal of the ACM (JACM)
Separating Nondeterministic Time Complexity Classes

Journal of the ACM (JACM)
Inductive Inference: Theory and Methods

ACM Computing Surveys (CSUR)
An overview of computational complexity

Communications of the ACM
Complexity of computations

Communications of the ACM
On the learnability of recursively enumerable languages from good examples

Theoretical Computer Science
Synthesizing noise-tolerant language learners

Theoretical Computer Science
Aspects of complexity of probabilistic learning under monotonicity constraints

Theoretical Computer Science - Algorithmic learning theory
Control structures in hypothesis spaces: the influence on learning

Theoretical Computer Science
Generalization and specialization strategies for learning r.e. languages

Annals of Mathematics and Artificial Intelligence
Learning recursive languages from good examples

Annals of Mathematics and Artificial Intelligence
Identifying nearly minimal Gödel numbers from additional information

Annals of Mathematics and Artificial Intelligence
Learning classes of approximations to non-recursive functions

Theoretical Computer Science
Inductive inference with additional information

Journal of Computer and System Sciences
A Survey of Some Quantitative Approaches to the Notion of Information

Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Towards the Validation of Inductive Learning Systems

ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Learning with Refutation

ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Synthesizing Learners Tolerating Computable Noisy Data

ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Consistent Polynominal Identification in the Limit

ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
On the Uniform Learnability of Approximations to Non-Recursive Functions

ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Learning Languages in a Union

ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Refutable Language Learning with a Neighbor System

ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Learning Recursive Functions Refutably

ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Reflective Inductive Inference of Recursive Functions

ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
On Variants of Iterative Learning

DS '98 Proceedings of the First International Conference on Discovery Science
Robust Learning - Rich and Poor

COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Merging Uniform Inductive Learners

COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Comparing the Power of Probabilistic Learning and Oracle Identification Under Monotonicity Constraints

ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Learning How to Separate

ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Variants of iterative learning

Theoretical Computer Science
A survey of some quantitative approaches to the notion of information

Formal and natural computing
Refutable language learning with a neighbor system

Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
On learning of functions refutably

Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Computational complexity of probabilistic Turing machines

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Type two computational complexity

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Sets that don't help

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Computer Science And Recursion Theory

ACM '78 Proceedings of the 1978 annual conference
The computation of finite functions

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Program size and economy of descriptions: Preliminary Report

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
A patent problem for abstract programming languages; machine-independent computations

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Classification of computable functions by primitive recursive classes

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Complexity classes of partial recursive functions (Preliminary Version)

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On the size of programs in subrecursive formalisms

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Unsolvability considerations in computational complexity

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Recursive properties of abstract complexity classes (Preliminary Version)

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Hierarchies based on computational complexity and irregularities of class determining measured sets (Preliminary Report)

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
On bounds on the number of steps to compute functions

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
On effective procedures for speeding up algorithms

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
On classes of computable functions

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
On minimal-program complexity measures

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Classes of computable functions defined by bounds on computation: Preliminary Report

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Speed-ups by changing the order in which sets are enumerated (Preliminary Version)

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Intrinsic complexity of learning geometrical concepts from positive data

Journal of Computer and System Sciences
Learning how to separate

Theoretical Computer Science - Special issue: Algorithmic learning theory
Independence results in computer science

ACM SIGACT News
Learning all subfunctions of a function

Information and Computation
Robust learning: rich and poor

Journal of Computer and System Sciences
Relations between gold-style learning and query learning

Information and Computation
Inductive inference of approximations for recursive concepts

Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Variations on U-shaped learning

Information and Computation
The Intrinsic Complexity of Learning: A Survey

Fundamenta Informaticae
Learning languages in a union

Journal of Computer and System Sciences
Axioms for time dependence of resource consumption in computing recursive functions

ACM SIGACT News
A corrected definition of "local speed-up"

ACM SIGACT News
Weak complexity measures

ACM SIGACT News
Complexity of computations

ACM Turing award lectures
An overview of computational complexity

ACM Turing award lectures
Turing award lecture: on computational complexity and the nature of computer science

ACM Turing award lectures
Turing award lecture: it's time to reconsider time

ACM Turing award lectures
Results on memory-limited U-shaped learning

Information and Computation
Some natural conditions on incremental learning

Information and Computation
Learning multiple languages in groups

Theoretical Computer Science
B70-5 Theories of Abstract Automata

IEEE Transactions on Computers
On the Efficiency of Universal Machines

IEEE Transactions on Computers
Iterative learning from positive data and negative counterexamples

Information and Computation
The intensional content of Rice's theorem

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computational processes

Record of the Project MAC conference on concurrent systems and parallel computation
Non-U-shaped vacillatory and team learning

Journal of Computer and System Sciences
Learning languages from positive data and negative counterexamples

Journal of Computer and System Sciences
Learning indexed families of recursive languages from positive data: A survey

Theoretical Computer Science
Learning and extending sublanguages

Theoretical Computer Science
Learning recursive functions: A survey

Theoretical Computer Science
Reflective inductive inference of recursive functions

Theoretical Computer Science
Learning in Friedberg numberings

Information and Computation
How crystals that sense and respond to their environments could evolve

Natural Computing: an international journal
U-shaped, iterative, and iterative-with-counter learning

Machine Learning
Complexity measures for software engineering

Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science,Software Engineering, Information Technology, e-Business, and Applications, 2003
A Classification of Viruses Through Recursion Theorems

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Characterizing Programming Systems Allowing Program Self-reference

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Speed-Up Theorems in Type-2 Computation

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Learning in Friedberg Numberings

ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Consistent and coherent learning with δ-delay

Information and Computation
On some open problems in reflective inductive inference

Information Processing Letters
On the complexity of proving functions

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
On the structure of Blum measure

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Theory of computing in computer science education

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Sup-interpretations, a semantic method for static analysis of program resources

ACM Transactions on Computational Logic (TOCL)
Quantitative Aspects of Speed-Up and Gap Phenomena

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Formal theories of language acquisition: practical and theoretical perspectives

IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
One-sided error probabilistic inductive inference and reliable frequency identification

Information and Computation
Relations between Gold-style learning and query learning

Information and Computation
Approximation and complexity of functions on the integers

Information Sciences: an International Journal
Complexity problems in real time languages

Information Sciences: an International Journal
Research in the theory of inductive inference by GDR mathematicians-A survey

Information Sciences: an International Journal
On the density of honest subrecursive classes

Journal of Computer and System Sciences
Depth-bounded computation

Journal of Computer and System Sciences
The enumerability and invariance of complexity classes

Journal of Computer and System Sciences
Subrecursive programming languages II on program size

Journal of Computer and System Sciences
Polynomial and abstract subrecursive classes

Journal of Computer and System Sciences
The reduction of tape reversals for off-line one-tape Turing machines

Journal of Computer and System Sciences
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences
Abstract computational complexity and cycling computations

Journal of Computer and System Sciences
The extent and density of sequences within the minimal-program complexity hierarchies

Journal of Computer and System Sciences
The computational complexity of program schemata

Journal of Computer and System Sciences
On computational reducibility

Journal of Computer and System Sciences
On the structure of subrecursive degrees

Journal of Computer and System Sciences
Augmented loop languages and classes of computable functions

Journal of Computer and System Sciences
Complexity-class-encoding sets

Journal of Computer and System Sciences
Complexity classes of partial recursive functions

Journal of Computer and System Sciences
Degrees of computational complexity

Journal of Computer and System Sciences
Nonexistence of program optimizers in several abstract settings

Journal of Computer and System Sciences
Effective operators with no strong gaps*

Journal of Computer and System Sciences
Consistency conditions for inductive inference of recursive functions

JSAI'06 Proceedings of the 20th annual conference on New frontiers in artificial intelligence
Costs of general purpose learning

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
U-shaped, iterative, and iterative-with-counter learning

COLT'07 Proceedings of the 20th annual conference on Learning theory
Learning correction grammars

COLT'07 Proceedings of the 20th annual conference on Learning theory
Basic notions in computational complexity

Algorithms and theory of computation handbook
Complexity classes

Algorithms and theory of computation handbook
Ubiquity symposium 'What is computation?': Computation is process

Ubiquity
Inductive inference of languages from samplings

ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Quantitative aspects of speed-up and gap phenomena

Mathematical Structures in Computer Science
Note: Speedup for natural problems and noncomputability

Theoretical Computer Science
Event-related outputs of computations in P systems

Journal of Automata, Languages and Combinatorics
On the amount of nonconstructivity in learning recursive functions

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Optimal language learning from positive data

Information and Computation
Computing: a perspective from industry

ACM Inroads
Towards a better understanding of incremental learning

ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Resource analysis by sup-interpretation

FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Non U-shaped vacillatory and team learning

ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Learning multiple languages in groups

ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Memory-limited u-shaped learning

COLT'06 Proceedings of the 19th annual conference on Learning Theory
Variations on u-shaped learning

COLT'05 Proceedings of the 18th annual conference on Learning Theory
Hilbert's tenth problem and paradigms of computation

CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
A note on blum static complexity measures

WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Properties Complementary to Program Self-Reference

Fundamenta Informaticae
Randomness behaviour in blum universal static complexity spaces

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Accepting Networks of Genetic Processors are computationally complete

Theoretical Computer Science
Turing machine-inspired computer science results

CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
The Intrinsic Complexity of Learning: A Survey

Fundamenta Informaticae
Properties complementary to program self-reference

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.08

Visualization

Abstract

The number of steps required to compute a function depends, in general, on the type of computer that is used, on the choice of computer program, and on the input-output code. Nevertheless, the results obtained in this paper are so general as to be nearly independent of these considerations.A function is exhibited that requires an enormous number of steps to be computed, yet has a “nearly quickest” program: Any other program for this function, no matter how ingeniously designed it may be, takes practically as many steps as this nearly quickest program.A different function is exhibited with the property that no matter how fast a program may be for computing this function another program exists for computing the function very much faster.