Pages that link to "Item:Q3152238"
From MaRDI portal
The following pages link to IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE? (Q3152238):
Displayed 35 items.
- Computability of entropy and information in classical Hamiltonian systems (Q653552) (← links)
- Computing Schrödinger propagators on type-2 Turing machines (Q864440) (← links)
- Can Newtonian systems, bounded in space, time, mass and energy compute all functions? (Q870250) (← links)
- Computations via Newtonian and relativistic kinematic systems (Q1036523) (← links)
- Computational bounds on polynomial differential equations (Q1036531) (← links)
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536) (← links)
- Comparing representations for function spaces in computable analysis (Q1635809) (← links)
- Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines (Q1770395) (← links)
- On the computability of the set of automorphisms of the unit square (Q2072068) (← links)
- Bit-complexity of solving systems of linear evolutionary partial differential equations (Q2117092) (← links)
- Computability with polynomial differential equations (Q2482915) (← links)
- Embedding infinitely parallel computation in Newtonian kinematics (Q2497873) (← links)
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations (Q2693688) (← links)
- Computability and Dynamical Systems (Q2908425) (← links)
- The impact of models of a physical oracle on computational power (Q2919942) (← links)
- Incomputability in Physics and Biology (Q2919943) (← links)
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis (Q3188250) (← links)
- On Computability of Navier-Stokes’ Equation (Q3195712) (← links)
- Computability of the Solutions to Navier-Stokes Equations via Effective Approximation (Q3297826) (← links)
- Computability, noncomputability and undecidability of maximal intervals of IVPs (Q3629381) (← links)
- Computations with oracles that measure vanishing quantities (Q4593234) (← links)
- On the computational complexity of the Dirichlet Problem for Poisson's Equation (Q4593239) (← links)
- Computable and Continuous Partial Homomorphisms on Metric Partial Algebras (Q4650302) (← links)
- Computing Uniform Bounds (Q4916180) (← links)
- The Solution Operator of the Korteweg-de Vries Equation is Computable (Q4916194) (← links)
- Complexity of Blowup Problems (Q4918017) (← links)
- Computing Solutions of Symmetric Hyperbolic Systems of PDE's (Q4918019) (← links)
- Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs (Q4918029) (← links)
- Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I) (Q4921435) (← links)
- The Significance of Relativistic Computation for the Philosophy of Mathematics (Q5015969) (← links)
- Computability of Differential Equations (Q5024569) (← links)
- Computational unsolvability of domains of attraction of nonlinear systems (Q5322874) (← links)
- Experimental computation of real numbers by Newtonian machines (Q5438843) (← links)
- Computational complexity with experiments as oracles (Q5505107) (← links)
- Semantics of computable physical models (Q6057623) (← links)