 It is only known that the ant's trajectory is always unbounded regardless of the initial configuration – this is known as the Cohen–Kong theorem.In 2000, Gajardo et al.showed a construction that calculates any boolean circuit using the trajectory of a single instance of Langton's ant.