Pages that link to "Item:Q1239156"
From MaRDI portal
The following pages link to Enumerations of families of general recursive functions (Q1239156):
Displayed 14 items.
- A learning-theoretic characterization of classes of recursive functions (Q673668) (← links)
- Some applications of computable one-one numberings (Q750430) (← links)
- Preserving categoricity and complexity of relations (Q887644) (← links)
- Effective categoricity of abelian \(p\)-groups (Q1023056) (← links)
- Stability among r.e. quotient algebras (Q1208085) (← links)
- Learning languages and functions by erasing (Q1575464) (← links)
- Computability-theoretic categoricity and Scott families (Q1740457) (← links)
- Learning by the process of elimination (Q1854541) (← links)
- On universal pairs in the Ershov hierarchy (Q2221958) (← links)
- Effective categoricity of equivalence structures (Q2498900) (← links)
- A computably stable structure with no Scott family of finitary formulas (Q2501165) (← links)
- Enumerations in computable structure theory (Q2570135) (← links)
- There is no classification of the decidably presentable structures (Q4562439) (← links)
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES (Q5207571) (← links)