The computational limits to the cognitive power of the neuroidal tabula rasa

DOI10.1080/0952813021000047189zbMath1084.68112OpenAlexW2061010170MaRDI QIDQ4474974

Juraj Wiedermann

Publication date: 22 July 2004

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: http://www.nusl.cz/ntk/nusl-33854

zbMATH Keywords

Turing MachinesFinite AutomataNeural NetsComputational PowerNeuroids

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)

Related Items (1)

Question answering by humans and machines: a complexity-theoretic view

Cites Work

• On the computational power of neural nets
• Algorithmic learning theory. 10th international conference, ALT '99, Tokyo, Japan, December 6--8, 1999. Proceedings
• Theory of neuromata
• Optimal simulation of automata by neural nets
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The computational limits to the cognitive power of the neuroidal tabula rasa