Pages that link to "Item:Q1032637"

The following pages link to Turing oracle machines, online computing, and three displacements in computability theory (Q1032637):

Displaying 9 items.

• The never-ending recursion (Q1688713) (← links)
• ``Viral'' Turing machines, computation from noise and combinatorial hierarchies (Q1694134) (← links)
• Bounded Turing reductions and data processing inequalities for sequences (Q1787951) (← links)
• Concrete digital computation: what does it take for a physical system to compute? (Q2255184) (← links)
• Formalism and intuition in computability (Q2941588) (← links)
• Rice and Rice-Shapiro Theorems for transfinite correction grammars (Q3096086) (← links)
• Program Size Complexity of Correction Grammars in the Ershov Hierarchy (Q3188262) (← links)
• Who Asked Us? How the Theory of Computing Answers Questions about Analysis (Q3297823) (← links)
• Why Turing’s Thesis Is Not a Thesis (Q4637226) (← links)