Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A Survey on Analog Models of Computation - MaRDI portal

A Survey on Analog Models of Computation (Q5024572)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7464644

Language	Label	Description	Also known as
English	A Survey on Analog Models of Computation	scientific article; zbMATH DE number 7464644

Statements

scholarly article

0 references

A Survey on Analog Models of Computation (English)

0 references

0 references

Olivier Bournez

0 references

Theory and Applications of Computability

0 references

publication date

26 January 2022

0 references

full work available at URL

https://arxiv.org/abs/1805.05729

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

A theory of timed automata

0 references

0 references

Computation in networks of passively mobile finite-state sensors

0 references

The computational power of population protocols

0 references

Linear programming and the Newton barrier flow

0 references

Hybrid systems. Computation and control. 1st international workshop, HSCC '98, Berkeley, CA, USA, April 13--15, 1998. Proceedings

0 references

Timed regular expressions

0 references

0 references

Achilles and the tortoise climbing up the arithmetical hierarchy

0 references

Reachability analysis of dynamical systems having piecewise-constant derivatives

0 references

Low dimensional hybrid systems -- decidable, undecidable, don't know

0 references

0 references

Real Interactive Proofs for VPSPACE.

0 references

An algebraic proof of the real number PCP theorem

0 references

A complex analogue of Toda's theorem

0 references

Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem

0 references

Karmarkar's linear programming algorithm and Newton's method

0 references

On the complexity of bounded time and precision reachability for piecewise affine systems

0 references

0 references

Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds

0 references

A Hierarchy for $$ BPP //\log \!\star $$ B P P / / log ⋆ Based on Counting Calls to an Oracle

0 references

Computational complexity with experiments as oracles

0 references

Experimental computation of real numbers by Newtonian machines

0 references

On the decidability and complexity of problems for restricted hierarchical hybrid systems

0 references

Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract)

0 references

Probabilistic analysis of a differential equation for linear programming

0 references

A theory of complexity for continuous time systems

0 references

Logical Reversibility of Computation

0 references

Non-standard semantics of hybrid systems modelers

0 references

The chemical abstract machine

0 references

0 references

COMPLEXITY AND REAL COMPUTATION: A MANIFESTO

0 references

On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

0 references

The Church-Turing Thesis over Arbitrary Domains

0 references

Three Paths to Effectiveness

0 references

Achilles and the tortoise climbing up the hyper-arithmetical hierarchy

0 references

How much can analog and hybrid systems be proved (super-)Turing

0 references

0 references

Polynomial differential equations compute all real computable functions on computable compact intervals

0 references

Homonym population protocols

0 references

Towards an Axiomatization of Simple Analog Algorithms

0 references

Axiomatizing Analog Algorithms

0 references

Computing with Large Populations Using Interactions

0 references

On the functions generated by the general purpose analog computer

0 references

Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version)

0 references

Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length

0 references

Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions

0 references

0 references

A Universal Ordinary Differential Equation

0 references

Model Checking Real-Time Systems

0 references

0 references

0 references

Extending stochastic and quantum functions

0 references

Noise vs computational intractability in dynamics

0 references

Tight space-noise tradeoffs in computing the ergodic measure

0 references

On Reachability for Hybrid Automata over Bounded Time

0 references

Robustness of Expressivity in Chemical Reaction Networks

0 references

0 references

Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems

0 references

The Computational Power of Interactive Recurrent Neural Networks

0 references

The expressive power of analog recurrent neural networks on infinite input streams

0 references

Expressive power of first-order recurrent neural networks determined by their attractor dynamics

0 references

0 references

Continuous-time computation with restricted integration capabilities

0 references

Iteration, inequalities, and differentiability in analog computers

0 references

An analog characterization of the Grzegorczyk hierarchy

0 references

The elementary computable functions over the real numbers: applying two new techniques

0 references

Strand Algebras for DNA Computing

0 references

Turing universality of the Biochemical Ground Form

0 references

Constructing Continuous Systems from Discrete Cellular Automata

0 references

The halting probability Omega: irreducible complexity in pure mathematics

0 references

Passively mobile communicating machines that use restricted space

0 references

0 references

The Convergence of Bird Flocking

0 references

An algorithmic approach to collective behavior

0 references

Diffusive Influence Systems

0 references

Deterministic function computation with chemical reaction networks

0 references

Rate-independent computation in continuous chemical reaction networks

0 references

0 references

On Recurrent Reachability for Continuous Linear Dynamical Systems

0 references

Physical constraints on hypercomputation

0 references

Continuity and computability of reachable sets

0 references

Hybrid Systems: Computation and Control

0 references

0 references

0 references

Hypercomputation: Philosophical issues

0 references

The ARNN model relativises \(\mathrm{P}=\mathrm{NP}\) and \(\mathrm{P}\neq \mathrm{NP}\)

0 references

The New Promise of Analog Computation

0 references

A foundation for real recursive function theory

0 references

Undecidable Hopf bifurcation with undecidable fixed point

0 references

Dynamical system where proving chaos is equivalent to proving Fermat's conjecture

0 references

Construction of a universal ordinary differential equation \(C^{\infty}\) of order 3

0 references

Probability 1 Computation with Chemical Reaction Networks

0 references

On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols

0 references

Building Infinite Machines

0 references

Alan Turing: Life and Legacy of a Great Thinker

0 references

Machines, Computations, and Universality

0 references

A Natural Axiomatization of Computability and Proof of Church's Thesis

0 references

Quantum theory, the Church–Turing principle and the universal quantum computer

0 references

Timing in chemical reaction networks

0 references

0 references

The physical Church thesis as an explanation of the Galileo thesis

0 references

New Computational Paradigms

0 references

0 references

0 references

Verification of population protocols

0 references

Non-Turing computations via Malament--Hogarth space-times

0 references

Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs

0 references

Abstract interpretation and types for systems biology

0 references

Dynamical Systems which Solve Optimization Problems with Linear Constraints

0 references

La thèse de l’hyper-calcul : enjeux et problèmes philosophiques

0 references

Conservative logic

0 references

0 references

Finite Automata over Structures

0 references

0 references

0 references

Strong Turing Degrees for Additive BSS RAM's

0 references

On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method

0 references

Study of dynamical systems from the viewpoint of complexity and computational capabilities

0 references

A Step towards a Complexity Theory for Analog Systems

0 references

Some Aspects of a Complexity Theory for Continuous Time Systems

0 references

Some recent developments on Shannon's General Purpose Analog Computer

0 references

New Computational Paradigms

0 references

Analog computers and recursive functions over the reals.

0 references

Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures

0 references

The design of novel distributed protocols from differential equations

0 references

Sequential abstract-state machines capture sequential algorithms

0 references

Programming in Biomolecular Computation

0 references

Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors

0 references

Optimization and dynamical systems

0 references

What's decidable about hybrid automata?

0 references

0 references

Evolutionary game dynamics

0 references

Neurons with graded response have collective computational properties like those of two-state neurons.

0 references

Real-time computability of real numbers by chemical reaction networks

0 references

Topological automata

0 references

A new polynomial-time algorithm for linear programming

0 references

Polynomial algorithms in linear programming

0 references

Hypercomputation with quantum adiabatic processes

0 references

0 references

Computability with low-dimensional dynamical systems

0 references

Closed-form analytic maps in one and two dimensions can simulate universal Turing machines

0 references

Discrete-time and continuous-time modelling: some bridges and gaps

0 references

Unconventional Computation

0 references

0 references

Taylor approximation for hybrid systems

0 references

The discrete versus continuous controversy in physics

0 references

A Differentially Algebraic Replacement Theorem, and Analog Computability

0 references

Computability on reals, infinite limits and differential equations

0 references

0 references

0 references

The promise of analog computation

0 references

Natural computation and non-Turing models of computation

0 references

0 references

0 references

On Ladner's result for a class of real machines with restricted use of constants

0 references

Generalized finite automata over real and complex numbers

0 references

Periodic Generalized Automata over the Reals

0 references

Compactness in the Theory of Continuous Automata

0 references

Mediated population protocols

0 references

Tractional Motion Machines: Tangent-Managing Planar Mechanisms as Analog Computers and Educational Artifacts

0 references

The nature of the extended analog computer

0 references

Unpredictability and undecidability in dynamical systems

0 references

Recursion theory on the reals and continuous-time computation

0 references

0 references

0 references

The Euclid Abstract Machine: Trisection of the Angle and the Halting Problem

0 references

Real recursive functions and their hierarchy

0 references

The P\(\neq\) NP conjecture in the context of real and complex analysis

0 references

SOFSEM 2006: Theory and Practice of Computer Science

0 references

Relativistic computers and the Turing barrier

0 references

0 references

Membrane computing. An introduction.

0 references

A guide to membrane computing.

0 references

Les deux formes de la thèse de Church-Turing et l’épistémologie du calcul

0 references

Differential dynamic logic for hybrid systems

0 references

Logical Analysis of Hybrid Systems

0 references

The Complete Proof Theory of Hybrid Systems

0 references

A Uniform Substitution Calculus for Differential Dynamic Logic

0 references

Logical Foundations of Cyber-Physical Systems

0 references

Fixed Point Techniques in Analog Systems

0 references

0 references

Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)

0 references

Efficient Turing-Universal Computation with DNA Polymers

0 references

Automata over continuous time

0 references

From finite automata toward hybrid systems (Extended abstract)

0 references

A Mathematical View of Interior-Point Methods in Convex Optimization

0 references

Limits of computation. From a programming perspective

0 references

Handbook of Natural Computing

0 references

A universal differential equation

0 references

The extended analog computer

0 references

0 references

Undecidable event detection problems for ODEs of dimension one and two

0 references

Chomskian hierarchies of families of sets of piecewise continuous functions

0 references

0 references

Emulating cellular automata in chemical reaction-diffusion networks

0 references

Storage Modification Machines

0 references

Mathematical Theory of the Differential Analyzer

0 references

0 references

Analog computation via neural networks

0 references

On the computational power of neural nets

0 references

Continuous-Time Symmetric Hopfield Nets Are Computationally Universal

0 references

General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results

0 references

Church's thesis meets the \(N\)-body problem

0 references

Computation with finite stochastic chemical reaction networks

0 references

Complexity of Self‐Assembled Shapes

0 references

Hypercomputation

0 references

A mathematical model for adaptive transport network in path finding by true slime mold

0 references

0 references

Computability of analog networks

0 references

Computability of Operators on Continuous and Discrete Time Streams

0 references

The complexity of analog computation

0 references

Trace-based methods for solving nonlinear global optimization and satisfiability problems

0 references

0 references

0 references

The Extent of Computation in Malament–Hogarth Spacetimes

0 references

An optical model of computation

0 references

Identifiers

10.1007/978-3-030-59234-9_6

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5024572

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5024572&oldid=36761407"