Pages that link to "Item:Q2479313"
From MaRDI portal
The following pages link to An explicit solution to Post's problem over the reals (Q2479313):
Displaying 12 items.
- Computational processes, observers and Turing incompleteness (Q616506) (← links)
- Real computational universality: the word problem for a class of groups with infinite presentation (Q734136) (← links)
- A hierarchy below the halting problem for additive machines (Q1015375) (← links)
- Equality is a jump (Q1292397) (← links)
- Post's problem for supertasks has both positive and negative solutions (Q1407554) (← links)
- A topological view on algebraic computation models (Q1679677) (← links)
- Generalized finite automata over real and complex numbers (Q2354406) (← links)
- 2010 North American Annual Meeting of the Association for Symbolic Logic (Q3083467) (← links)
- Computation over algebraic structures and a classification of undecidable problems (Q4593236) (← links)
- SOME INITIAL THOUGHTS ON BOUNDED QUERY COMPUTATIONS OVER THE REALS (Q4923293) (← links)
- Discussion on “An effective method for the explicit solution of sequential problems on the real line” by Sören Christensen (Q5892441) (← links)
- Logical Approaches to Computational Barriers (Q5898835) (← links)
