The point isn&#x27;t necessarily one graph representation, but simply that any problem can be looked at in a graphy manner if you try hard enough, so &quot;hey, it&#x27;s a graph&quot; isn&#x27;t an interesting insight. But to answer your question, data flow graphs are a general representation of function composition, and Turing machines can be looked at as graphs with labeled edges. Yes, we&#x27;re using &quot;isomorphism&quot; in the pop-compsci, Gödel-Escher-Bach sense.