Approximability in the GPAC

MaRDI QIDQ5232906zbMATH OpenFDO

Authors Diogo Poças, Jeffery Zucker

Publication date 13 September 2019

Full work available at URL https://arxiv.org/abs/1801.07661

zbMATH Keywords

analog computabilitydifferential equationsGPAC

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Classical models of computation (Turing machines, etc.) (68Q04)

Recommendations

• Analog networks on function data streams
• On the functions generated by the general purpose analog computer
• Analog computers and recursive functions over the reals.
• Theory and Applications of Models of Computation
• Computing with polynomial ordinary differential equations

Cited in

(9)

• On the functions generated by the general purpose analog computer
• Tracking computability of GPAC-generable functions
• Some recent developments on Shannon's General Purpose Analog Computer
• Gap Amplification in PCPs Using Lazy Random Walks
• Analog networks on function data streams
• New Computational Paradigms
• Theory and Applications of Models of Computation
• Iteration, inequalities, and differentiability in analog computers
• A continuous characterization of PSPACE using polynomial ordinary differential equations

Describes a project that uses

Uses Software

• DLMF

This page was built for publication: Approximability in the GPAC

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232906)