Its actually pretty hard for even humans to eyeball a graph and figure it out. For example, the wiki article on the peterson graph (https://en.wikipedia.org/wiki/Petersen_graph) has a few drawings that you cant easily say are the same graph.
78 karma · joined May 14, 2015
This is typically not very popular as these statements depend a lot on the program, and the representations of programs unlike the halting problem computability statement.
Although searching for "the lie behind the lie detector" gives the first result as the correct one from anitpolygraph.
Is it possible google didn't really do anything shady?