On some decision problems in programming

DOI10.1006/inco.1995.1143zbMath0834.68002OpenAlexW2088629964MaRDI QIDQ1900317

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)

Related Items (9)

Rice’s Theorem in Effectively Enumerable Topological Spaces ⋮ Computation over algebraic structures and a classification of undecidable problems ⋮ Computable elements and functions in effectively enumerable topological spaces ⋮ Some results related to the continuity problem ⋮ Effectivity and effective continuity of multifunctions ⋮ Can partial indexings be totalized? ⋮ On effective topological spaces ⋮ Strong reducibility of partial numberings ⋮ Representations versus numberings: On the relationship of two computability notions

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