Universal Turing machine

    flowchart
    AA["Associated Authors (0)"]
    C[Universal Turing machine]
    BC["Broader Concepts (1)"]
    NC["Narrower Concepts (8)"]
    C== skos:broader ==>BC
    NC== skos:broader ==>C
    AA== dcterms:relation ==>C
    click BC "#broader-concepts"
    click NC "#narrower-concepts"
    click AA "#associated-authors"

    NI["add incoming edge"]
    NO["add outgoing edge"]
    NI-- ? -->C
    C-- ? -->NO
    click NI "#add-incoming-edge"
    click NO "#add-outgoing-edge"
    style NI stroke-width:2px,stroke-dasharray: 5 5
    style NO stroke-width:2px,stroke-dasharray: 5 5
Graph neighborhood for 'Universal Turing machine'. Click aggregate nodes to navigate.
Wikidata
https://www.wikidata.org/wiki/Q2703890
OpenAlex ID
https://openalex.org/C131671149 (API record)
OpenAlex Description
turing machine that can simulate an arbitrary Turing machine on arbitrary input by reading both the description of the machine to be simulated as well as the input thereof from its own tape
OpenAlex Level [?]
4

Broader Concepts

Narrower Concepts

Associated Authors

Add Incoming Edge

Login via ORCiD to contribute.

Add Outgoing Edge

Login via ORCiD to contribute.