On a Question of Frank Stephan

DOI10.1007/978-3-540-79228-4_37zbMath1140.03313OpenAlexW1564994090MaRDI QIDQ3502666

Ambos-Spies, Klaus, S. A. Badaev, Sergei S. Goncharov

Publication date: 27 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_37

zbMATH Keywords

computable family of setsequivalent numberingsTxtEX learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (1)

Inductive inference and computable numberings

Cites Work

• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a Question of Frank Stephan