ATProto Browser

Record data

{
  "uri": "at://did:plc:n4h4l26bx2g5kuiqrz4gdatk/app.bsky.feed.post/3lbbzdg7xes2z",
  "cid": "bafyreicepkf4winlcgckyt7jpc3isgjcmfdivgi5lel27ukpv7pdxb6hza",
  "value": {
    "text": "Preprint on Assembly Theory and its Relationship with Computational Complexity, arxiv.org/abs/2406.12176 showing why AT is NOT equivalent to other measures e.g.  Shannon, Huffman, LZW compression & prove why assembly index is not in the same complexity class as these algorithms.",
    "$type": "app.bsky.feed.post",
    "embed": {
      "$type": "app.bsky.embed.external",
      "external": {
        "uri": "https://arxiv.org/abs/2406.12176",
        "thumb": {
          "$type": "blob",
          "ref": {
            "$link": "bafkreigayenaigptc5htqebt2l75crifxoktax2fvyo355id6ihcailgfm"
          },
          "mimeType": "image/jpeg",
          "size": 103004
        },
        "title": "Assembly Theory and its Relationship with Computational Complexity",
        "description": "Assembly theory (AT) quantifies selection using the assembly equation and identifies complex objects that occur in abundance based on two measurements, assembly index and copy number, where the assemb..."
      }
    },
    "langs": [
      "en"
    ],
    "facets": [
      {
        "index": {
          "byteEnd": 104,
          "byteStart": 80
        },
        "features": [
          {
            "uri": "https://arxiv.org/abs/2406.12176",
            "$type": "app.bsky.richtext.facet#link"
          }
        ]
      }
    ],
    "createdAt": "2024-11-19T08:28:52.678Z"
  }
}