These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
142 related articles for article (PubMed ID: 37151505)
21. Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines. Soler-Toscano F; Zenil H; Delahaye JP; Gauvrit N PLoS One; 2014; 9(5):e96223. PubMed ID: 24809449 [TBL] [Abstract][Full Text] [Related]
22. 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]
23. An RNA-based theory of natural universal computation. Akhlaghpour H J Theor Biol; 2022 Mar; 537():110984. PubMed ID: 34979104 [TBL] [Abstract][Full Text] [Related]
24. Versatile and Programmable DNA Logic Gates on Universal and Label-Free Homogeneous Electrochemical Platform. Ge L; Wang W; Sun X; Hou T; Li F Anal Chem; 2016 Oct; 88(19):9691-9698. PubMed ID: 27582358 [TBL] [Abstract][Full Text] [Related]
25. Representing logic gates over Euclidean space via heaviside step function. Iacovelli G; Iacovelli C Sci Rep; 2022 May; 12(1):8009. PubMed ID: 35568712 [TBL] [Abstract][Full Text] [Related]
26. A mechanical Turing machine: blueprint for a biomolecular computer. Shapiro E Interface Focus; 2012 Aug; 2(4):497-503. PubMed ID: 22649583 [TBL] [Abstract][Full Text] [Related]
27. Stepwise self-assembly of DNA tile lattices using dsDNA bridges. Park SH; Finkelstein G; LaBean TH J Am Chem Soc; 2008 Jan; 130(1):40-1. PubMed ID: 18072780 [TBL] [Abstract][Full Text] [Related]
28. Programmable DNA tile self-assembly using a hierarchical sub-tile strategy. Shi X; Lu W; Wang Z; Pan L; Cui G; Xu J; LaBean TH Nanotechnology; 2014 Feb; 25(7):075602. PubMed ID: 24451169 [TBL] [Abstract][Full Text] [Related]
29. Graph Computation Using Algorithmic Self-Assembly of DNA Molecules. Xu J; Chen C; Shi X ACS Synth Biol; 2022 Jul; 11(7):2456-2463. PubMed ID: 35703038 [TBL] [Abstract][Full Text] [Related]
30. Triangular DNA Origami Tilings. Tikhomirov G; Petersen P; Qian L J Am Chem Soc; 2018 Dec; 140(50):17361-17364. PubMed ID: 30512944 [TBL] [Abstract][Full Text] [Related]
31. Toward a theory of evolutionary computation. Eberbach E Biosystems; 2005 Oct; 82(1):1-19. PubMed ID: 16102892 [TBL] [Abstract][Full Text] [Related]
32. An information-bearing seed for nucleating algorithmic self-assembly. Barish RD; Schulman R; Rothemund PW; Winfree E Proc Natl Acad Sci U S A; 2009 Apr; 106(15):6054-9. PubMed ID: 19321429 [TBL] [Abstract][Full Text] [Related]
34. DNA-Based Adaptive Plasmonic Logic Gates. Dong J; Wang M; Zhou Y; Zhou C; Wang Q Angew Chem Int Ed Engl; 2020 Aug; 59(35):15038-15042. PubMed ID: 32406595 [TBL] [Abstract][Full Text] [Related]
35. Mutation-selection dynamics and error threshold in an evolutionary model for Turing machines. Musso F; Feverati G Biosystems; 2012 Jan; 107(1):18-33. PubMed ID: 21906654 [TBL] [Abstract][Full Text] [Related]
36. Diverse and robust molecular algorithms using reprogrammable DNA self-assembly. Woods D; Doty D; Myhrvold C; Hui J; Zhou F; Yin P; Winfree E Nature; 2019 Mar; 567(7748):366-372. PubMed ID: 30894725 [TBL] [Abstract][Full Text] [Related]
37. Self-Assembling Molecular Logic Gates Based on DNA Crossover Tiles. Campbell EA; Peterson E; Kolpashchikov DM Chemphyschem; 2017 Jul; 18(13):1730-1734. PubMed ID: 28234410 [TBL] [Abstract][Full Text] [Related]
38. Learning system parameters from turing patterns. Schnörr D; Schnörr C Mach Learn; 2023; 112(9):3151-3190. PubMed ID: 37575882 [TBL] [Abstract][Full Text] [Related]
39. Demonstration of a universal surface DNA computer. Su X; Smith LM Nucleic Acids Res; 2004; 32(10):3115-23. PubMed ID: 15181177 [TBL] [Abstract][Full Text] [Related]
40. On the Convergence of Tsetlin Machines for the XOR Operator. Jiao L; Zhang X; Granmo OC; Abeyrathna KD IEEE Trans Pattern Anal Mach Intell; 2023 May; 45(5):6072-6085. PubMed ID: 36070276 [TBL] [Abstract][Full Text] [Related] [Previous] [Next] [New Search]