Pages that link to "Item:Q1424349"

The following pages link to On Gurevich's theorem on sequential algorithms (Q1424349):

Displaying 4 items.

• In some curved spaces, one can solve NP-hard problems in polynomial time (Q843612) (← links)
• Axiomatizing Analog Algorithms (Q3188259) (← links)
• A Natural Axiomatization of Computability and Proof of Church's Thesis (Q3616433) (← links)
• (Q5013888) (← links)