On Symmetric and Choiceless Computation - Topics in Theoretical Computer Science Access content directly
Conference Papers Year : 2016

On Symmetric and Choiceless Computation

Anuj Dawar
  • Function : Author
  • PersonId : 999373
Computer Laboratory [Cambridge]

Abstract

Formal models of computation such as Turing machines are usually defined as performing operations on strings of symbols.

Domains

Computer Science [cs]
Fichier principal
Vignette du fichier
385217_1_En_2_Chapter.pdf (192.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

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

Download

Dates and versions

hal-01446261 , version 1 (25-01-2017)

Licence

Attribution

Identifiers

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

IFIP-LNCS IFIP IFIP-TC IFIP-TC1 IFIP-LNCS-9541
63 View
138 Download

Altmetric

Share

Gmail Facebook X LinkedIn More