Results 191 to 200 of about 2,960,567 (255)

The Mathematical Foundation of Post-Quantum Cryptography. [PDF]

Research (Wash D C)
Zong C.
europepmc   +1 more source

Learned denoising with simulated and experimental low-dose CT data. [PDF]

Sci Rep
Kiss MB, Biguri A, Schönlieb CB, Batenburg KJ, Lucka F.   +4 more
europepmc   +1 more source

Training biologists in Unix command-line skills: From curriculum to interactive online tutorials. [PDF]

PLoS Comput Biol
Khamvongsa-Charbonnier L, Aboukhalil R, Chiapello H, Denecker T, Poulain P, Puthier D, Sand O, Thomas-Chollier M, Toffano-Nioche C.   +8 more
europepmc   +1 more source

Bidirectional Endothelial Feedback Drives Turing-Vascular Patterning and Drug-Resistance Niches: A Hybrid PDE-Agent-Based Study. [PDF]

Bioengineering (Basel)
Liu Z, Wang LS, Yu J, Zhang J, Martel E, Li S.   +5 more
europepmc   +1 more source

Efficient event-based delay learning in spiking neural networks. [PDF]

Nat Commun
Mészáros B, Knight JC, Nowotny T.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Emergent neural turing machine and its visual navigation

Neural Networks, 2019
Traditional Turing Machines (TMs) are symbolic whose hand-crafted representations are static and limited. Developmental Network 1 (DN-1) uses emergent representation to perform Turing Computation. But DN-1 lacks hierarchy in its internal representations,
Zejia Zheng, Xiang Wu, Juyang Weng
exaly   +2 more sources

Ternary-task convolutional bidirectional neural turing machine for assessment of EEG-based cognitive workload

Biomedical Signal Processing and Control, 2020
Cognitive workload plays a crucial role in the observation of mental activity which has great significance in brain-computer interfaces (BCI), cognitive neuroscience and biomedical fields.
Weizheng Qiao, Xiaojun Bi
semanticscholar   +1 more source

A physically universal Turing machine

Journal of Computer and System Sciences, 2023
We construct a two-dimensional Turing machine that is physically universal in both the moving tape and moving head model. In particular, it is mixing of all finite orders in both models. We also provide a variant that is physically universal in the moving tape model, but not in the moving head model.
Ville Salo, Ilkka Torma
exaly   +5 more sources

A Simple Universal Turing Machine for the Game of Life Turing Machine

Journal of Cellular Automata, 2011
In this chapter we present a simple universal Turing machine which is small enough to fit into the design limits of the Turing machine build in Conway’s Game of Life by the author. That limit is 8 symbols and 16 states. By way of comparison we also describe one of the smallest known universal Turing machines due to Rogozhin which has 6 symbols and 4 ...
Paul W. Rendell
semanticscholar   +3 more sources