Name: | Description: | Size: | Format: | |
---|---|---|---|---|
219.41 KB | Adobe PDF |
Advisor(s)
Abstract(s)
In this paper, we show that there are Initial Value Problems de ned
with polynomial ordinary di erential equations that can simulate univer-
sal Turing machines in the presence of bounded noise. The polynomial
ODE de ning the IVP is explicitly obtained and the simulation is per-
formed in real time.