scientific article; zbMATH DE number 3431764
From MaRDI portal
Publication:5183082
zbMath0274.68001MaRDI QIDQ5183082
Walter S. Brainerd, Lawrence H. Landweber
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of software (68N01) Turing machines and related notions (03D10) Hierarchies of computability and definability (03D55)
Related Items (14)
Unnamed Item ⋮ Unnamed Item ⋮ The independence of control structures in abstract programming systems ⋮ On the mathematical foundations of \textit{Syntactic structures} ⋮ Some notes on Church's thesis and the theory of games ⋮ Two types of properties for complexity measures ⋮ On the structure of sets in NP and other complexity classes ⋮ Unnamed Item ⋮ Comparison of identification criteria for machine inductive inference ⋮ Forecasting errors and bounded rationality: An example ⋮ A consideration of a practical implementation for a new convergence division ⋮ Polynomial time computations in models of ET ⋮ On the complexity-relativized strong reducibilities ⋮ The recursion-theoretic structure of complexity classes
This page was built for publication:
