Pages that link to "Item:Q1349924"

The following pages link to Recursive characterization of computable real-valued functions and relations (Q1349924):

Displaying 16 items.

• A characterization of computable analysis on unbounded domains using differential equations (Q719239) (← links)
• A refined model of computation for continuous problems (Q1265141) (← links)
• Computable invariance (Q1274805) (← links)
• Feasible real random access machines (Q1279912) (← links)
• Computability on subsets of Euclidean space. I: Closed and compact subsets (Q1292398) (← links)
• Concrete models of computation for topological algebras (Q1292413) (← links)
• Computation by `While' programs on topological partial algebras (Q1292414) (← links)
• Computable total functions on metric algebras, universal algebraic specifications and dynamical systems (Q1764798) (← links)
• Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations (Q1885034) (← links)
• A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations (Q2104133) (← links)
• Semantics of a sequential language for exact real-number computation (Q2373708) (← links)
• Decidability in analysis (Q2572942) (← links)
• Relative computability and uniform continuity of relations (Q2930869) (← links)
• How constructive is constructing measures? (Q2987777) (← links)
• Semantical proofs of correctness for programs performing non-deterministic tests on real numbers (Q3060187) (← links)
• Sequential Real Number Computation and Recursive Relations (Q4918036) (← links)