scientific article; zbMATH DE number 408772

zbMath0819.68094MaRDI QIDQ4202914

No author found.

Publication date: 6 September 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial time inference machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Logic in artificial intelligence (68T27) Pattern recognition, speech recognition (68T10)

Related Items (6)

Learning unions of tree patterns using queries ⋮ Exact Learning of Finite Unions of Graph Patterns from Queries ⋮ Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets ⋮ Developments from enquiries into the learnability of the pattern languages from positive data ⋮ Learning concepts and their unions from positive data with refinement operators ⋮ Learning unions of tree patterns using queries

This page was built for publication: