Pages that link to "Item:Q913786"
From MaRDI portal
The following pages link to An easy priority-free proof of a theorem of Friedberg (Q913786):
Displaying 14 items.
- Some applications of computable one-one numberings (Q750430) (← links)
- Learning in Friedberg numberings (Q939445) (← links)
- Learning-theoretic perspectives of acceptable numberings (Q1380421) (← links)
- Friedberg numberings of families of partial computable functionals (Q2003244) (← links)
- Learnability and positive equivalence relations (Q2232273) (← links)
- On approximate decidability of minimal programs (Q2828213) (← links)
- Nonstandard models in recursion theory and reverse mathematics (Q2925331) (← links)
- Numberings and Randomness (Q3576037) (← links)
- Diagonals and -maximal sets (Q4292592) (← links)
- On recursive enumerability with finite repetitions (Q4934022) (← links)
- Definitional schemes for primitive recursive and computable functions (Q5037214) (← links)
- Effectively infinite classes of numberings of computable families of reals (Q6086824) (← links)
- Effectively infinite classes of numberings and computable families of reals (Q6146823) (← links)
- Learnability and positive equivalence relations (Q6186308) (← links)