Skip to Main content Skip to Navigation
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-01446261
Contributor : Hal Ifip <>
Submitted on : Wednesday, January 25, 2017 - 4:50:50 PM
Last modification on : Wednesday, January 25, 2017 - 4:58:07 PM
Document(s) archivé(s) le : 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

Identifiers

Citation

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⟩

Share

Metrics

Record views

99

Files downloads

132