S-K reduction machine An {abstract machine} defined by Professor {David Turner} to evaluate {combinator} expressions represented as {binary graphs}. Named after the two basic combinators, S and K.