Results 151 to 160 of about 2,596,832 (272)
AI from the point of view of ordinary language
Abstract I shall first consider two puzzles that illustrate the contrast between everyday experience or ordinary language, on the one hand, and scientific description on the other. What is common to them is simply that the ordinary description and the scientific description seem to conflict, and the philosopher is called upon to resolve the apparent ...
Gary Kemp
wiley +1 more source
Transmission and spectral aspects of tight-binding Hamiltonians for the counting quantum Turing machine [PDF]
Paul Benioff
openalex +1 more source
A Self-Replicating Universal Turing Machine [PDF]
Héctor Fabio Restrepo+2 more
openalex +1 more source
Gödel’s Philosophical Challenge (to Turing)
DOI: http://doi.org/10.26333/sts.xxxiv1.03 The incompleteness theorems constitute the mathematical core of Gödel’s philosophical challenge. They are given in their “most satisfactory form”, as Gödel saw it, when the formality of theories to which they
Wilfried Sieg
doaj
Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA. [PDF]
Currin A+6 more
europepmc +1 more source
Infinite Time Turing Machines With Only One Tape [PDF]
Joel David Hamkins, Daniel Evan Seabold
openalex +1 more source
Actualmente las LSTM son los modelos más utilizados para problemas de análisis de secuencias, pero se ven limitadas en ciertos aspectos al tratar con secuencias largas o problemas en los que es necesario recordar demasiada información. Las NTM proponen una mejora de las capacidades de las redes neuronales recurrentes a través del uso de ...
openaire +1 more source
Triple equivalence for the emergence of biological intelligence
Intelligent algorithms developed evolutionarily within neural systems are considered in this work. Mathematical analyses unveil a triple equivalence between canonical neural networks, variational Bayesian inference under a class of partially observable ...
Takuya Isomura
doaj +1 more source