Pages that link to "Item:Q1274815"
From MaRDI portal
The following pages link to Closed-form analytic maps in one and two dimensions can simulate universal Turing machines (Q1274815):
Displaying 20 items.
- Computation with perturbed dynamical systems (Q355515) (← links)
- Low dimensional hybrid systems -- decidable, undecidable, don't know (Q418141) (← links)
- Real recursive functions and their hierarchy (Q706790) (← links)
- An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable (Q905698) (← links)
- What is a universal computing machine? (Q1036530) (← links)
- Instability, complexity, and evolution (Q1036993) (← links)
- Dynamical recognizers: real-time language recognition by analog computers (Q1129007) (← links)
- The futility of utility: how market dynamics marginalize Adam Smith (Q1577068) (← links)
- A theory of complexity for continuous time systems (Q1599194) (← links)
- On undecidability bounds for matrix decision problems (Q2474220) (← links)
- Physical constraints on hypercomputation (Q2482458) (← links)
- Computability with polynomial differential equations (Q2482915) (← links)
- The P\(\neq\) NP conjecture in the context of real and complex analysis (Q2489146) (← links)
- Analog computation beyond the Turing limit (Q2497879) (← links)
- An RNA-based theory of natural universal computation (Q2670144) (← links)
- Computability and Dynamical Systems (Q2908425) (← links)
- SOLVING DIFFERENCE EQUATIONS IN SEQUENCES: UNIVERSALITY AND UNDECIDABILITY (Q3304645) (← links)
- Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs (Q4918029) (← links)
- Average-Case Completeness in Tag Systems (Q5090467) (← links)
- Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines (Q6048001) (← links)
