Task: Text Matching
Input (English): Generalized Turing machines and simple inductive turing machines are two classes of super-recursive algorithms that come closest to the recursive algorithms .
Generalized Turing machines and super-recursive Turing machines are two classes of simple inductive algorithms that are the closest to recursive algorithms .
Output (English): Not paraphrase