Sentence 1: Generalized Turing machines and simple inductive turing machines are two classes of super-recursive algorithms that come closest to the recursive algorithms .
Sentence 2: Generalized Turing machines and super-recursive Turing machines are two classes of simple inductive algorithms that are the closest to recursive algorithms .
Question: Do Sentence 1 and Sentence 2 express the same meaning? Yes or No?