Pages that link to "Item:Q1280231"

The following pages link to A survey on real structural complexity theory (Q1280231):

Displaying 16 items.

• Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536) (← links)
• Achilles and the tortoise climbing up the hyper-arithmetical hierarchy (Q1274806) (← links)
• On the computational power of dynamical systems and hybrid systems (Q1349871) (← links)
• Elimination of constants from machines over algebraically closed fields (Q1361877) (← links)
• On NP-completeness for linear machines (Q1368835) (← links)
• Counting problems over the reals (Q1575534) (← links)
• Isomorphism theorem for BSS recursively enumerable sets over real closed fields (Q1575912) (← links)
• On the computational structure of the connected components of a hard problem (Q1607000) (← links)
• A survey of recursive analysis and Moore's notion of real computation (Q1761708) (← links)
• Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
• On the expressiveness and decidability of o-minimal hybrid systems (Q2387414) (← links)
• \(\mathbf P =\mathbf{NP}\) for some structures over the binary words (Q2387422) (← links)
• Two situations with unit-cost: ordered abelian semi-groups and some commutative rings (Q2387423) (← links)
• An explicit solution to Post's problem over the reals (Q2479313) (← links)
• Kolmogorov Complexity Theory over the Reals (Q4918012) (← links)
• Logics which capture complexity classes over the reals (Q5055931) (← links)