M. L. Campagnolo

We study a restricted version of Shannon's general purpose analog computer in which we only allow the machine to solve linear differential equations. Expand

We propose an automatic control system to partially replace CAPI for crop identification, with the overreaching goal of reducing control costs and completion time. Expand

In this paper, we show that closed-form analytic maps and flows can simulate Turing machines in an error-robust manner. Expand

We provide an overview of theories of continuous time computation. Expand

The theory of analog computation, where the internal states of a computer are continuous rather than discrete, has enjoyed a recent resurgence of interest. Expand

We consider whether the set G of GPAC-computable functions is closed under iteration, that is, whether for any function f(x)?G there is a function F(x, t)=ft(x) for nonnegative integers t. Expand

In this paper, we show that there are initial value problems defined with polynomial ordinary differential equations that can simulate universal Turing machines in the presence of bounded noise. Expand

We estimate the point spread function (PSF) of nominal 250-m MODIS gridded surface reflectance products from sequences of daily images over man-made large-size targets. Expand