Pages that link to "Item:Q3260572"

The following pages link to Gödel numberings of partial recursive functions (Q3260572):

Displaying 11 items.

• Comparison of identification criteria for machine inductive inference (Q585192) (← links)
• Anomalous learning helps succinctness (Q671420) (← links)
• Characterizing language identification in terms of computable numberings (Q676311) (← links)
• On the non-existence of maximal inference degrees for language identification (Q685478) (← links)
• Program self-reference in constructive Scott subdomains (Q693046) (← links)
• Characterizing programming systems allowing program self-reference (Q733737) (← links)
• Enumerations of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msubsup><mml:mi mathvariant="normal">Π</mml:mi><mml:mn>1</mml:mn><mml:mn>0</mml:mn></mml:msubsup></mml:math> Classes: Acceptability and Decid (Q4921447) (← links)
• La théorie des fonctions récursives et ses applications. (Exposé d'information générale) (Q5536266) (← links)
• Programmkomplexität von berechenbaren Funktionen (Q5604468) (← links)
• Numberings, c.e. oracles, and fixed points (Q6062177) (← links)
• How much partiality is needed for a theory of computability? (Q6146825) (← links)