| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
On Symmetric and Choiceless Computation
Abstract : Formal models of computation such as Turing machines are usually defined as performing operations on strings of symbols.
Cited literature [13 references]
https://hal.inria.fr/hal-01446261
Contributor : Hal Ifip Connect in order to contact the contributor
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
Contributor : Hal Ifip Connect in order to contact the contributor
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
File
385217_1_En_2_Chapter.pdf
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution 4.0 International License