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

DOI10.1080/0952813021000047189zbMATH Open1084.68112OpenAlexW2061010170MaRDI QIDQ4474974FDOQ4474974

Authors: Jiří 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

Recommendations

• Publication:4955301
• A neuroidal architecture for cognitive computation
• scientific article; zbMATH DE number 1490014
• Computational theories of mind, and Fodor's analysis of neural network behaviour
• scientific article; zbMATH DE number 978376
• A theory of consciousness: computation, algorithm, and neurobiological realization
• A quantitative theory of neural computation

zbMATH Keywords

Turing MachinesFinite AutomataNeural NetsComputational PowerNeuroids

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the computational power of neural nets
• Algorithmic learning theory. 10th international conference, ALT '99, Tokyo, Japan, December 6--8, 1999. Proceedings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal simulation of automata by neural nets
• Theory of neuromata

Cited In (2)

• Title not available (Why is that?)
• Question answering by humans and machines: a complexity-theoretic view

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

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