Timeline for How can DNA Computing solve very complex problems that are present in cryptography?
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 5, 2022 at 19:54 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Oct 6, 2018 at 19:42 | history | edited | kelalaka | CC BY-SA 4.0 |
added Adlemann's DNA computing steps and reduction from factoring to Hamiltonian path
|
| Sep 26, 2018 at 21:48 | comment | added | kelalaka | The video; see the dust on the computer at 0:38 nanoporetech.com/products/minion | |
| Sep 26, 2018 at 20:48 | history | edited | kelalaka | CC BY-SA 4.0 |
grammer mistakes.
|
| Sep 26, 2018 at 19:37 | vote | accept | R1w | ||
| Sep 26, 2018 at 18:20 | history | edited | kelalaka | CC BY-SA 4.0 |
added new research DNA computing.
|
| Sep 26, 2018 at 13:16 | comment | added | kelalaka | Not computing, but storage. youtube.com/watch?v=tBvd7OSDGgQ | |
| Sep 26, 2018 at 13:15 | comment | added | Meir Maor | No, test tubes are not microscopic. And 2^52 test tube would require approximately the area of South Africa. | |
| Sep 26, 2018 at 11:38 | comment | added | Paul Uszak | @MeirMaor I know diddly squat about DNA computing. But isn't DNA smallish? So could a test tube be small too? Like microscopic, such as silicon based computing circuits? | |
| Sep 26, 2018 at 10:24 | comment | added | kelalaka | Very big, indeed. | |
| Sep 26, 2018 at 10:20 | comment | added | Meir Maor | 2^52 test tubes is small?! | |
| Sep 26, 2018 at 10:11 | history | answered | kelalaka | CC BY-SA 4.0 |