Optimization Among Provably Equivalent Programs

DOI10.1145/322033.322046MaRDI QIDQ4185798zbMATH OpenOpenAlexFDO

Authors

Publication date 1977

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://docs.lib.purdue.edu/cstech/103

zbMATH Keywords

Probably Equivalent ProgramsProgram CorrectnessRecursion-Theoretic Complexity Theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(5)

• Complexity classes of provable recursive functions
• Independence results in computer science?
• Relations between diagonalization, proof systems, and complexity gaps
• Discontinuities of provably correct operators on the provably recursive real numbers
• On “provable” analogs of and

This page was built for publication: Optimization Among Provably Equivalent Programs

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