On some decision problems in programming
From MaRDI portal
Publication:1900317
DOI10.1006/inco.1995.1143zbMath0834.68002MaRDI QIDQ1900317
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
68N01: General topics in the theory of software
Related Items
On effective 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, Representations versus numberings: On the relationship of two computability notions, Strong reducibility of partial numberings, Can partial indexings be totalized?, Rice’s Theorem in Effectively Enumerable Topological Spaces, Effectivity and effective continuity of multifunctions