The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly (Q3654379): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59884888, #quickstatements; #temporary_batch_1703753727431 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/080723971 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2062970222 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:15, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly |
scientific article |
Statements
The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly (English)
0 references
6 January 2010
0 references
DNA computing
0 references
molecular computing
0 references
self-assembly
0 references
tiling
0 references
undecidability
0 references
