Matches in SemOpenAlex for { <https://semopenalex.org/work/W1600567704> ?p ?o ?g. }
Showing items 1 to 78 of
78
with 100 items per page.
- W1600567704 endingPage "580" @default.
- W1600567704 startingPage "565" @default.
- W1600567704 abstract "Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computation operate on strings. While graphs may be encoded as strings (via an adjacency matrix), the encoding imposes a linear order on vertices. This enables a Turing machine operating on encodings of graphs to choose an arbitrary element from any nonempty set of vertices at low cost (the Augmenting Paths algorithm for Bipartite Matching being an example of the power of choice). However, the outcome of a computation is liable to depend on the external linear order (i.e., the choice of encoding). Moreover, isomorphism-invariance/encoding-independence is an undecidable property of Turing machines. This trouble with encodings led Blass, Gurevich and Shelah [3] to propose a model of computation known as BGS machines that operate directly on structures. BGS machines preserve symmetry at every step in a computation, sacrificing the ability to make arbitrary choices between indistinguishable elements of the input structure (hence “choiceless computation”). Blass et al. also introduced a complexity class CPT+C (Choiceless Polynomial Time with Counting) defined in terms of polynomially bounded BGS machines. While every property finite structures in CPT+C is polynomial-time computable in the usual sense, it is open whether conversely every isomorphism-invariant property in P belongs to CPT+C. In this paper we give evidence that CPT+C $ne$ P by proving the separation of the corresponding classes of function problems. Specifically, we show that there is an isomorphism-invariant polynomial-time computable function problem on finite vector spaces (“given a finite vector space V, output the set of hyperplanes in V”) that is not computable by any CPT+C program. In addition, we give a new simplified proof of the Support Theorem, which is a key step in the result of [3] that a weak version of CPT+C absent counting cannot decide the parity of sets." @default.
- W1600567704 created "2016-06-24" @default.
- W1600567704 creator A5007686466 @default.
- W1600567704 date "2010-01-01" @default.
- W1600567704 modified "2023-10-18" @default.
- W1600567704 title "Choiceless Computation and Symmetry" @default.
- W1600567704 cites W1484653117 @default.
- W1600567704 cites W1984890936 @default.
- W1600567704 cites W1989783863 @default.
- W1600567704 cites W2055008899 @default.
- W1600567704 cites W2088094394 @default.
- W1600567704 cites W2116445981 @default.
- W1600567704 cites W2117313088 @default.
- W1600567704 cites W2181072414 @default.
- W1600567704 cites W2592241421 @default.
- W1600567704 cites W43155751 @default.
- W1600567704 doi "https://doi.org/10.1007/978-3-642-15025-8_28" @default.
- W1600567704 hasPublicationYear "2010" @default.
- W1600567704 type Work @default.
- W1600567704 sameAs 1600567704 @default.
- W1600567704 citedByCount "8" @default.
- W1600567704 countsByYear W16005677042013 @default.
- W1600567704 countsByYear W16005677042014 @default.
- W1600567704 countsByYear W16005677042015 @default.
- W1600567704 countsByYear W16005677042018 @default.
- W1600567704 countsByYear W16005677042020 @default.
- W1600567704 countsByYear W16005677042023 @default.
- W1600567704 crossrefType "book-chapter" @default.
- W1600567704 hasAuthorship W1600567704A5007686466 @default.
- W1600567704 hasConcept C11413529 @default.
- W1600567704 hasConcept C114614502 @default.
- W1600567704 hasConcept C118615104 @default.
- W1600567704 hasConcept C132525143 @default.
- W1600567704 hasConcept C184596265 @default.
- W1600567704 hasConcept C197657726 @default.
- W1600567704 hasConcept C203776342 @default.
- W1600567704 hasConcept C29248071 @default.
- W1600567704 hasConcept C311688 @default.
- W1600567704 hasConcept C33923547 @default.
- W1600567704 hasConcept C39637292 @default.
- W1600567704 hasConcept C41008148 @default.
- W1600567704 hasConcept C45374587 @default.
- W1600567704 hasConcept C61665672 @default.
- W1600567704 hasConcept C80444323 @default.
- W1600567704 hasConceptScore W1600567704C11413529 @default.
- W1600567704 hasConceptScore W1600567704C114614502 @default.
- W1600567704 hasConceptScore W1600567704C118615104 @default.
- W1600567704 hasConceptScore W1600567704C132525143 @default.
- W1600567704 hasConceptScore W1600567704C184596265 @default.
- W1600567704 hasConceptScore W1600567704C197657726 @default.
- W1600567704 hasConceptScore W1600567704C203776342 @default.
- W1600567704 hasConceptScore W1600567704C29248071 @default.
- W1600567704 hasConceptScore W1600567704C311688 @default.
- W1600567704 hasConceptScore W1600567704C33923547 @default.
- W1600567704 hasConceptScore W1600567704C39637292 @default.
- W1600567704 hasConceptScore W1600567704C41008148 @default.
- W1600567704 hasConceptScore W1600567704C45374587 @default.
- W1600567704 hasConceptScore W1600567704C61665672 @default.
- W1600567704 hasConceptScore W1600567704C80444323 @default.
- W1600567704 hasLocation W16005677041 @default.
- W1600567704 hasOpenAccess W1600567704 @default.
- W1600567704 hasPrimaryLocation W16005677041 @default.
- W1600567704 hasRelatedWork W1486286946 @default.
- W1600567704 hasRelatedWork W1504200807 @default.
- W1600567704 hasRelatedWork W1551708390 @default.
- W1600567704 hasRelatedWork W1722394934 @default.
- W1600567704 hasRelatedWork W2075449032 @default.
- W1600567704 hasRelatedWork W2085484366 @default.
- W1600567704 hasRelatedWork W2315104758 @default.
- W1600567704 hasRelatedWork W3005925191 @default.
- W1600567704 hasRelatedWork W3103990451 @default.
- W1600567704 hasRelatedWork W4221160330 @default.
- W1600567704 isParatext "false" @default.
- W1600567704 isRetracted "false" @default.
- W1600567704 magId "1600567704" @default.
- W1600567704 workType "book-chapter" @default.