On the Super-Turing Computational Power of Non-Uniform Families of Neuromata.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F02%3A06020216" target="_blank" >RIV/67985807:_____/02:06020216 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On the Super-Turing Computational Power of Non-Uniform Families of Neuromata.
Original language description
It is shown that the computational power of non-uniform infinite families of (discrete) neural nets reading their inputs sequentially (so-called neuromata), of polynomial size, equals to PSPACE/poly, and of logarithmic size to LOGSPACE/log. Thus, such families posses super-Turing computational power. From computational complexity point of view the above mentioned results rank the respective families of neuromata among the most powerful computational devices known today.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F00%2F1489" target="_blank" >GA201/00/1489: Soft Computing: Theoretical foundations and experiments</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Neural Network World
ISSN
1210-0552
e-ISSN
—
Volume of the periodical
N/A
Issue of the periodical within the volume
5
Country of publishing house
CZ - CZECH REPUBLIC
Number of pages
8
Pages from-to
509-516
UT code for WoS article
—
EID of the result in the Scopus database
—