The following pages link to (Q5624687):
Displaying 16 items.
- Computationalism, the Church-Turing thesis, and the Church-Turing fallacy (Q882835) (← links)
- Pattern associativity and the retrieval of semantic networks (Q1202672) (← links)
- What is computation? (Q1293030) (← links)
- On Alan Turing's anticipation of connectionism (Q1293032) (← links)
- The modal argument for hypercomputing minds (Q1434374) (← links)
- Computational capabilities of analog and evolving neural networks over infinite input streams (Q1713481) (← links)
- Neural-like P systems with plasmids (Q2051790) (← links)
- A Church-Turing thesis for randomness? (Q2117785) (← links)
- Turing: the great unknown (Q2151546) (← links)
- The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems (Q2383594) (← links)
- Definability as hypercomputational effect (Q2497876) (← links)
- Artificial Intelligence Evolved from Random Behaviour: Departure from the State of the Art (Q2866103) (← links)
- Recursively Generated Evolutionary Turing Machines and Evolutionary Automata (Q2866110) (← links)
- Expressive Power of Non-deterministic Evolving Recurrent Neural Networks in Terms of Their Attractor Dynamics (Q2945562) (← links)
- On dynamical genetic programming: simple Boolean networks in learning classifier systems (Q3645055) (← links)
- Physical Computability Theses (Q5119662) (← links)
