The semaphore codes attached to a Turing machine via resets and their various limits (Q5739484)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6604000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The semaphore codes attached to a Turing machine via resets and their various limits |
scientific article; zbMATH DE number 6604000 |
Statements
The semaphore codes attached to a Turing machine via resets and their various limits (English)
0 references
15 July 2016
0 references
P vs. NP problem
0 references
profinite limit
0 references
resets
0 references
semaphore codes
0 references
Turing machines
0 references
0.710145115852356
0 references
0.6933507919311523
0 references
0.6881401538848877
0 references
0.6840135455131531
0 references
0.6815561652183533
0 references
