Turing computability with neural nets (Q1190653): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Efficient simulation of finite automata by neural nets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3994777 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3998903 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4839054 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank | |||
Normal rank |
Latest revision as of 10:48, 16 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Turing computability with neural nets |
scientific article |
Statements
Turing computability with neural nets (English)
0 references
26 September 1992
0 references
neural network
0 references
Turing machine
0 references