Program schemata with polynomial bounded counters

DOI10.1016/0020-0190(75)90024-1MaRDI QIDQ1216043zbMATH OpenOpenAlexFDO

Authors Klaus Weihrauch

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

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

Cites work

• Classes of computable functions defined by bounds on computation
• scientific article; zbMATH DE number 3558923 (Why is no real title available?)
• scientific article; zbMATH DE number 3576680 (Why is no real title available?)
• On formalised computer programs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1216043)