On the computational power of particle methods

DOI10.46298/FI.11227MaRDI QIDQ6921241zbMATH OpenFDO

Authors Johannes Pahlke, Ivo F. Sbalzarini

Publication date 6 October 2025

Published in Fundamenta Informaticae (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.46298/FI.11227

zbMATH Keywords

automata theorycomputer simulationnumerical analysisparticle methodsTuring completeness

Mathematics Subject Classification ID

Classical models of computation (Turing machines, etc.) (68Q04) Other nonclassical models of computation (68Q09) Formal languages and automata (68Q45)

Cites work

• A general deterministic treatment of derivatives in particle methods
• Cohesion.
• Discretization correction of general integral PSE operators for particle methods
• On computable numbers, with an application to the Entscheidungsproblem.
• Smoothed particle hydrodynamics: theory and application to non-spherical stars
• The problem of the random walk.
• The Weighted Particle Method for Convection-Diffusion Equations. Part 1: The Case of an Isotropic Viscosity
• Three models for the description of language
• Turing machine universality of the game of life
• Universality in elementary cellular automata
• Using DC PSE operator discretization in Eulerian meshless collocation methods improves their robustness in complex geometries

This page was built for publication: On the computational power of particle methods

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