On Symmetric and Choiceless Computation
Abstract
Formal models of computation such as Turing machines are usually defined as performing operations on strings of symbols.
Domains
| Origin | Files produced by the author(s) |
|---|
Loading...
Conference Papers
Year : 2016
Hal Ifip : Connect in order to contact the contributor
https://inria.hal.science/hal-01446261
Submitted on : Wednesday, January 25, 2017-4:50:50 PM
Last modification on : Wednesday, January 25, 2017-4:58:07 PM
Long-term archiving on : Wednesday, April 26, 2017-3:01:28 PM
Dates and versions
Licence
Identifiers
- HAL Id : hal-01446261 , version 1
- DOI : 10.1007/978-3-319-28678-5_2
Cite
Anuj Dawar. On Symmetric and Choiceless Computation. 1st International Conference on Theoretical Computer Science (TTCS), Aug 2015, Tehran, Iran. pp.23-29, ⟨10.1007/978-3-319-28678-5_2⟩. ⟨hal-01446261⟩
Collections
96
View
175
Download