``Natural properties of flowchart step-counting measures

DOI10.1016/0022-0000(78)90047-8zbMath0368.68051OpenAlexW2028292383MaRDI QIDQ1242679

Theodore P. Baker

Publication date: 1978

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(78)90047-8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (1)

The intrinsic difficulty of recursive functions

Cites Work

• The enumerability and invariance of complexity classes
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Unsolvability in 3 × 3 Matrices
• Recursive Properties of Abstract Complexity Classes
• Unnamed Item

This page was built for publication: ``Natural properties of flowchart step-counting measures