Program schemata with polynomial bounded counters

DOI10.1016/0020-0190(75)90024-1zbMath0302.68031OpenAlexW2089054625MaRDI QIDQ1216043

Weihrauch, Klaus

Publication date: 1975

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(75)90024-1

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Cites Work

• On formalised computer programs
• Classes of computable functions defined by bounds on computation
• Unnamed Item
• Unnamed Item

This page was built for publication: Program schemata with polynomial bounded counters