Pages that link to "Item:Q1900317"
From MaRDI portal
The following pages link to On some decision problems in programming (Q1900317):
Displayed 9 items.
- Strong reducibility of partial numberings (Q1766927) (← links)
- Can partial indexings be totalized? (Q2758051) (← links)
- Rice’s Theorem in Effectively Enumerable Topological Spaces (Q3195700) (← links)
- Effectivity and effective continuity of multifunctions (Q3570164) (← links)
- On effective topological spaces (Q4391431) (← links)
- Computation over algebraic structures and a classification of undecidable problems (Q4593236) (← links)
- Computable elements and functions in effectively enumerable topological spaces (Q4593240) (← links)
- Some results related to the continuity problem (Q4593245) (← links)
- Representations versus numberings: On the relationship of two computability notions (Q5958133) (← links)