Given the task definition and input, reply with output. In this task you are given a sentence pair from wikipedia that have high lexical overlap. If the sentences have the same meaning and are just paraphrases of each other label them as "Paraphrase" , if not label them as "Not paraphrase". The two sentences are seperated by a new line.

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 simple inductive Turing machines are two classes of super-recursive algorithms that are the closest to recursive algorithms .

Paraphrase