FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W314885778> ?p ?o ?g. }

• W314885778 abstract "The structure and organization of information in binary strings and (infinite) binary sequences are investigated using two computable measures of complexity related to computational depth. First, fundamental properties of recursive computational depth, a refinement of Bennett's original notion of computational depth, are developed, and it is shown that the recursively weakly (respectively, strongly) deep sequences form a proper subclass of the class of weakly (respectively, strongly) deep sequences. It is then shown that every weakly useful sequence is recursively strongly deep, strengthening a theorem by Juedes, Lathrop, and Lutz. It follows from these results that not every strongly deep sequence is weakly useful, thereby answering an open question posed by Juedes.Second, compression depth, a feasibly computable depth measurement, is developed based on the Lempel-Ziv compression algorithm. LZ compression depth is further formalized by introducing strongly (compression) deep sequences and showing that analogues of the main properties of computational depth hold for compression depth. Critical to these results, it is shown that a sequence that is not normal must be compressible by the Lempei-Ziv algorithm. This yields a new, simpler proof that the Champernowne sequence is normal.Compression depth is also used to measure the organization of genes in genetic algorithms. Using finite-state machines to control the actions of an automaton playing prisoner's dilemma, a genetic algorithm is used to evolve a population of finite-state machines (players) to play prisoner's dilemma against each other. Since the fitness function is based solely on how well a player performs against all other players in the population, any accumulation of compression depth (organization) in the genetic structure of the player can only by attributed to the fact that more fit players have a more highly organized genetic structure. It is shown experimentally that this is the case." @default.
• W314885778 created "2016-06-24" @default.
• W314885778 creator A5001352332 @default.
• W314885778 date "2018-08-13" @default.
• W314885778 modified "2023-10-17" @default.
• W314885778 title "Computing and evolving variants of computational depth" @default.
• W314885778 cites W109076699 @default.
• W314885778 cites W1497256448 @default.
• W314885778 cites W1507363803 @default.
• W314885778 cites W1555991696 @default.
• W314885778 cites W1558033868 @default.
• W314885778 cites W1861312691 @default.
• W314885778 cites W1972067040 @default.
• W314885778 cites W2001109406 @default.
• W314885778 cites W2002089154 @default.
• W314885778 cites W2004542545 @default.
• W314885778 cites W2008797389 @default.
• W314885778 cites W2013481822 @default.
• W314885778 cites W2020311636 @default.
• W314885778 cites W2026888287 @default.
• W314885778 cites W2029308360 @default.
• W314885778 cites W2030143597 @default.
• W314885778 cites W2033651947 @default.
• W314885778 cites W2036943188 @default.
• W314885778 cites W2042587503 @default.
• W314885778 cites W2045709959 @default.
• W314885778 cites W2046937767 @default.
• W314885778 cites W2057399436 @default.
• W314885778 cites W2060108852 @default.
• W314885778 cites W2065534115 @default.
• W314885778 cites W2067377980 @default.
• W314885778 cites W2067580807 @default.
• W314885778 cites W2077218542 @default.
• W314885778 cites W2085831981 @default.
• W314885778 cites W2094687533 @default.
• W314885778 cites W2099111195 @default.
• W314885778 cites W2110216302 @default.
• W314885778 cites W2121361687 @default.
• W314885778 cites W2122962290 @default.
• W314885778 cites W2126160338 @default.
• W314885778 cites W2135499091 @default.
• W314885778 cites W2135625884 @default.
• W314885778 cites W2143667514 @default.
• W314885778 cites W2163052928 @default.
• W314885778 cites W2177218873 @default.
• W314885778 cites W2323777246 @default.
• W314885778 cites W2341539489 @default.
• W314885778 cites W2499081645 @default.
• W314885778 cites W2504846205 @default.
• W314885778 cites W2530006810 @default.
• W314885778 cites W2752853835 @default.
• W314885778 cites W28874459 @default.
• W314885778 cites W290342266 @default.
• W314885778 cites W3023540311 @default.
• W314885778 cites W415535753 @default.
• W314885778 doi "https://doi.org/10.31274/rtd-180813-13536" @default.
• W314885778 hasPublicationYear "2018" @default.
• W314885778 type Work @default.
• W314885778 sameAs 314885778 @default.
• W314885778 citedByCount "1" @default.
• W314885778 crossrefType "dissertation" @default.
• W314885778 hasAuthorship W314885778A5001352332 @default.
• W314885778 hasBestOaLocation W3148857781 @default.
• W314885778 hasConcept C2522767166 @default.
• W314885778 hasConcept C41008148 @default.
• W314885778 hasConcept C70721500 @default.
• W314885778 hasConcept C86803240 @default.
• W314885778 hasConceptScore W314885778C2522767166 @default.
• W314885778 hasConceptScore W314885778C41008148 @default.
• W314885778 hasConceptScore W314885778C70721500 @default.
• W314885778 hasConceptScore W314885778C86803240 @default.
• W314885778 hasLocation W3148857781 @default.
• W314885778 hasLocation W3148857782 @default.
• W314885778 hasOpenAccess W314885778 @default.
• W314885778 hasPrimaryLocation W3148857781 @default.
• W314885778 hasRelatedWork W2093578348 @default.
• W314885778 hasRelatedWork W2096946506 @default.
• W314885778 hasRelatedWork W2350741829 @default.
• W314885778 hasRelatedWork W2358668433 @default.
• W314885778 hasRelatedWork W2376932109 @default.
• W314885778 hasRelatedWork W2382290278 @default.
• W314885778 hasRelatedWork W2390279801 @default.
• W314885778 hasRelatedWork W2748952813 @default.
• W314885778 hasRelatedWork W2766271392 @default.
• W314885778 hasRelatedWork W2899084033 @default.
• W314885778 isParatext "false" @default.
• W314885778 isRetracted "false" @default.
• W314885778 magId "314885778" @default.
• W314885778 workType "dissertation" @default.