טוען...
How Chemistry Computes: Language Recognition by Non-Biochemical Chemical Automata. From Finite Automata to Turing Machines
Every problem in computing can be cast as decision problems of whether strings are in a language or not. Computations and language recognition are carried out by three classes of automata, the most complex of which is the Turing machine. Living systems compute using biochemistry; in the artificial,...
שמור ב:
| הוצא לאור ב: | iScience |
|---|---|
| Main Authors: | , |
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Elsevier
2019
|
| נושאים: | |
| גישה מקוונת: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6710637/ https://ncbi.nlm.nih.gov/pubmed/31442667 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1016/j.isci.2019.08.007 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|