``Natural properties of flowchart step-counting measures

DOI10.1016/0022-0000(78)90047-8zbMATH Open0368.68051OpenAlexW2028292383MaRDI QIDQ1242679FDOQ1242679

Authors: 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

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

Cites Work

• Title not available (Why is that?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Recursive Properties of Abstract Complexity Classes
• Unsolvability in 3 × 3 Matrices
• The enumerability and invariance of complexity classes

Cited In (1)

• The intrinsic difficulty of recursive functions

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

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