On some decision problems in programming

DOI10.1006/INCO.1995.1143MaRDI QIDQ1900317zbMATH OpenOpenAlexFDO

Authors Dieter Spreen

Publication date 30 October 1995

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1995.1143

zbMATH Keywords

correctness problem

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• scientific article; zbMATH DE number 139613
• Decidable problems for powerful programs
• scientific article; zbMATH DE number 1482995
• Publication:3032237
• scientific article; zbMATH DE number 3936927
• On solving complex programs
• Decision problems and round-off machines
• Decision problems for Turing machines
• On the complexity of discrete programming problems
• scientific article; zbMATH DE number 1873242

Cited in

(11)

• Strong reducibility of partial numberings
• Computable elements and functions in effectively enumerable topological spaces
• Computation over algebraic structures and a classification of undecidable problems
• Bad News on Decision Problems for Patterns
• Representations versus numberings: On the relationship of two computability notions
• Rice's theorem in effectively enumerable topological spaces
• Can partial indexings be totalized?
• Decidable problems for powerful programs
• On effective topological spaces
• Effectivity and effective continuity of multifunctions
• Some results related to the continuity problem

This page was built for publication: On some decision problems in programming

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