207 related articles for article (PubMed ID: 25667360)
1. Universal Memcomputing Machines.
Traversa FL; Di Ventra M
IEEE Trans Neural Netw Learn Syst; 2015 Nov; 26(11):2702-15. PubMed ID: 25667360
[TBL] [Abstract][Full Text] [Related]
2. Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states.
Traversa FL; Ramella C; Bonani F; Di Ventra M
Sci Adv; 2015 Jul; 1(6):e1500031. PubMed ID: 26601208
[TBL] [Abstract][Full Text] [Related]
3. On the Universality of Memcomputing Machines.
Pei YR; Traversa FL; Di Ventra M
IEEE Trans Neural Netw Learn Syst; 2019 Jun; 30(6):1610-1620. PubMed ID: 30387744
[TBL] [Abstract][Full Text] [Related]
4. Dynamic computing random access memory.
Traversa FL; Bonani F; Pershin YV; Di Ventra M
Nanotechnology; 2014 Jul; 25(28):285201. PubMed ID: 24972387
[TBL] [Abstract][Full Text] [Related]
5. Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines.
Traversa FL; Di Ventra M
Chaos; 2017 Feb; 27(2):023107. PubMed ID: 28249395
[TBL] [Abstract][Full Text] [Related]
6. The computational power of interactive recurrent neural networks.
Cabessa J; Siegelmann HT
Neural Comput; 2012 Apr; 24(4):996-1019. PubMed ID: 22295978
[TBL] [Abstract][Full Text] [Related]
7. Real-time computing without stable states: a new framework for neural computation based on perturbations.
Maass W; Natschläger T; Markram H
Neural Comput; 2002 Nov; 14(11):2531-60. PubMed ID: 12433288
[TBL] [Abstract][Full Text] [Related]
8. Toward a theory of evolutionary computation.
Eberbach E
Biosystems; 2005 Oct; 82(1):1-19. PubMed ID: 16102892
[TBL] [Abstract][Full Text] [Related]
9. Biologically relevant neural network architectures for support vector machines.
Jändel M
Neural Netw; 2014 Jan; 49():39-50. PubMed ID: 24126252
[TBL] [Abstract][Full Text] [Related]
10. Efficient solution of Boolean satisfiability problems with digital memcomputing.
Bearden SRB; Pei YR; Di Ventra M
Sci Rep; 2020 Nov; 10(1):19741. PubMed ID: 33184386
[TBL] [Abstract][Full Text] [Related]
11. The super-Turing computational power of plastic recurrent neural networks.
Cabessa J; Siegelmann HT
Int J Neural Syst; 2014 Dec; 24(8):1450029. PubMed ID: 25354762
[TBL] [Abstract][Full Text] [Related]
12. Oscillatory Neural Network-Based Ising Machine Using 2D Memristors.
Chen X; Yang D; Hwang G; Dong Y; Cui B; Wang D; Chen H; Lin N; Zhang W; Li H; Shao R; Lin P; Hong H; Yao Y; Sun L; Wang Z; Yang H
ACS Nano; 2024 Apr; 18(16):10758-10767. PubMed ID: 38598699
[TBL] [Abstract][Full Text] [Related]
13. Simplified and Yet Turing Universal Spiking Neural P Systems with Communication on Request.
Wu T; Bîlbîe FD; Păun A; Pan L; Neri F
Int J Neural Syst; 2018 Oct; 28(8):1850013. PubMed ID: 29759014
[TBL] [Abstract][Full Text] [Related]
14. P/NP, and the quantum field computer.
Freedman MH
Proc Natl Acad Sci U S A; 1998 Jan; 95(1):98-101. PubMed ID: 9419335
[TBL] [Abstract][Full Text] [Related]
15. Turing and von Neumann machines: Completing the new mechanism.
Jurková B; Zámečník L
Biosystems; 2023 Dec; 234():105046. PubMed ID: 37858737
[TBL] [Abstract][Full Text] [Related]
16. Computing with synthetic protocells.
Courbet A; Molina F; Amar P
Acta Biotheor; 2015 Sep; 63(3):309-23. PubMed ID: 25969126
[TBL] [Abstract][Full Text] [Related]
17. Revisiting the simulation of quantum Turing machines by quantum circuits.
Molina A; Watrous J
Proc Math Phys Eng Sci; 2019 Jun; 475(2226):20180767. PubMed ID: 31293355
[TBL] [Abstract][Full Text] [Related]
18. Stress-Testing Memcomputing on Hard Combinatorial Optimization Problems.
Sheldon F; Cicotti P; Traversa FL; Di Ventra M
IEEE Trans Neural Netw Learn Syst; 2020 Jun; 31(6):2222-2226. PubMed ID: 31395558
[TBL] [Abstract][Full Text] [Related]
19. Limit, logic, and computation.
Freedman MH
Proc Natl Acad Sci U S A; 1998 Jan; 95(1):95-7. PubMed ID: 9419334
[TBL] [Abstract][Full Text] [Related]
20. Small universal spiking neural P systems working in exhaustive mode.
Pan L; Zeng X
IEEE Trans Nanobioscience; 2011 Jun; 10(2):99-105. PubMed ID: 21712164
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
