scientific article; zbMATH DE number 1222608

MaRDI QIDQ4218151zbMATH OpenFDO

Authors Sylvain Porrot, Bruno Durand

Publication date 21 June 1999

zbMATH Keywords

Kolmogorov complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Comparison between the complexity of a function and the complexity of its graph
• Computation of recursive functionals using minimal initial segments
• A note on arbitrarily complex recursive functions
• scientific article; zbMATH DE number 1071771

Cited in

(6)

• A note on arbitrarily complex recursive functions
• Optimal series-parallel trade-offs for reducing a function to its own graph
• scientific article; zbMATH DE number 3929065 (Why is no real title available?)
• Probability and program-size for functions
• Comparison between the complexity of a function and the complexity of its graph
• Computation of recursive functionals using minimal initial segments

This page was built for publication:

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