Wikipedia:Articles for deletion/AjoChhand Machine
Expert''')&mdash;I'm not sure what this says about me, but I do have an inkling about the contents of the article.  The short version:  implement a general Turing Machine using only directed acyclic graph: each state/vertex encodes the entire execution history up to that point.  If you remember Finite Automata from your CompSci theory class, think of this as Infinite Automata where no state can be visited twice.  Maybe.  Or maybe not.  Anyway, single papers with single-digit citation counts and zero coverage in |reliable sources don't pass our notability guidelines.  I doubt very much this is a hoax&mdash;it's far too over the top for that&mdash;but neither does it belong on enWP
— User:Lesser, 02:24, 8 July 2014 (UTC)
Stance: delete
Cited policy: WP:RS (Wikipedia:Reliable sources)