"Futurama theorem" meaning in English

See Futurama theorem in All languages combined, or Wiktionary

Proper name

Etymology: From "The Prisoner of Benda" (2010), season 6, episode 10 of Futurama. The episode and the theorem were written by the mathematician Ken Keeler. Head templates: {{en-proper noun|head=Futurama theorem}} Futurama theorem
  1. (group theory) A theorem which proves that, given a mind swap machine that can't be used on the same pair of people more than once, it is possible to reverse any number of mind swaps by introducing two more people that did not have their minds swapped with anyone before. Wikipedia link: Futurama, Ken Keeler, The Prisoner of Benda Categories (topical): Group theory
    Sense id: en-Futurama_theorem-en-name-Sf1mY6Pn Categories (other): English entries with incorrect language header, Pages with 1 entry, Pages with entries Topics: group-theory, mathematics, sciences
{
  "etymology_text": "From \"The Prisoner of Benda\" (2010), season 6, episode 10 of Futurama. The episode and the theorem were written by the mathematician Ken Keeler.",
  "head_templates": [
    {
      "args": {
        "head": "Futurama theorem"
      },
      "expansion": "Futurama theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Group theory",
          "orig": "en:Group theory",
          "parents": [
            "Algebra",
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A theorem which proves that, given a mind swap machine that can't be used on the same pair of people more than once, it is possible to reverse any number of mind swaps by introducing two more people that did not have their minds swapped with anyone before."
      ],
      "id": "en-Futurama_theorem-en-name-Sf1mY6Pn",
      "links": [
        [
          "group theory",
          "group theory"
        ],
        [
          "theorem",
          "theorem"
        ],
        [
          "mind",
          "mind"
        ],
        [
          "swap",
          "swap"
        ],
        [
          "pair",
          "pair"
        ],
        [
          "reverse",
          "reverse"
        ]
      ],
      "raw_glosses": [
        "(group theory) A theorem which proves that, given a mind swap machine that can't be used on the same pair of people more than once, it is possible to reverse any number of mind swaps by introducing two more people that did not have their minds swapped with anyone before."
      ],
      "topics": [
        "group-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Futurama",
        "Ken Keeler",
        "The Prisoner of Benda"
      ]
    }
  ],
  "word": "Futurama theorem"
}
{
  "etymology_text": "From \"The Prisoner of Benda\" (2010), season 6, episode 10 of Futurama. The episode and the theorem were written by the mathematician Ken Keeler.",
  "head_templates": [
    {
      "args": {
        "head": "Futurama theorem"
      },
      "expansion": "Futurama theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms derived from Futurama",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Group theory"
      ],
      "glosses": [
        "A theorem which proves that, given a mind swap machine that can't be used on the same pair of people more than once, it is possible to reverse any number of mind swaps by introducing two more people that did not have their minds swapped with anyone before."
      ],
      "links": [
        [
          "group theory",
          "group theory"
        ],
        [
          "theorem",
          "theorem"
        ],
        [
          "mind",
          "mind"
        ],
        [
          "swap",
          "swap"
        ],
        [
          "pair",
          "pair"
        ],
        [
          "reverse",
          "reverse"
        ]
      ],
      "raw_glosses": [
        "(group theory) A theorem which proves that, given a mind swap machine that can't be used on the same pair of people more than once, it is possible to reverse any number of mind swaps by introducing two more people that did not have their minds swapped with anyone before."
      ],
      "topics": [
        "group-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Futurama",
        "Ken Keeler",
        "The Prisoner of Benda"
      ]
    }
  ],
  "word": "Futurama theorem"
}

Download raw JSONL data for Futurama theorem meaning in English (1.4kB)


This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-02-15 from the enwiktionary dump dated 2025-02-02 using wiktextract (ca09fec and c40eb85). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.