New considerations of denumerability, non-denumerability, and target-seeking algorithms

DOI10.1016/S0096-3003(98)10136-4MaRDI QIDQ1569129zbMATH OpenOpenAlexFDO

Authors N. Delaunay

Publication date 25 June 2000

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0096-3003(98)10136-4

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) General topics in artificial intelligence (68T01) Nonnumerical algorithms (68W05)

Cited in

(1)

• Definable inapproximability: new challenges for duplicator

This page was built for publication: New considerations of denumerability, non-denumerability, and target-seeking algorithms

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