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):
Displaying 9 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)
- Computer Science for Continuous Data (Q6487409) (← links)
