Pages that link to "Item:Q5554965"
From MaRDI portal
The following pages link to Godel Numberings Versus Friedberg Numberings (Q5554965):
Displayed 10 items.
- Computable one-to-one enumerations of effective domains (Q582908) (← links)
- Some applications of computable one-one numberings (Q750430) (← links)
- Computable single-valued numerations (Q1050980) (← links)
- The independence of control structures in abstract programming systems (Q1155949) (← links)
- Some effectively infinite classes of enumerations (Q1210351) (← links)
- Über die Reduzierbarkeit berechenbarer Numerierungen (Q1221753) (← links)
- Learning-theoretic perspectives of acceptable numberings (Q1380421) (← links)
- On computable enumerations. I (Q2264759) (← links)
- Semi-effective numberings and definitions of the computable numbers (Q5569449) (← links)
- How much partiality is needed for a theory of computability? (Q6146825) (← links)