Earlier papers studying problems solvable by Turing machines with specific bounded resources include  John Myhill's definition of linear bounded automata (Myhill 1960), Raymond Smullyan's study of rudimentary sets (1961), as well as Hisao Yamada's paper on real-time computations (1962). Somewhat earlier, Boris Trakhtenbrot (1956), a pioneer in the field from the USSR, studied another specific complexity measure. As he remembers:
In what year did Raymond Sullivan publish a study of rudimentary sets?
1961 1961 1961
Earlier papers studying problems solvable by Turing machines with specific bounded resources include  John Myhill's definition of linear bounded automata (Myhill 1960), Raymond Smullyan's study of rudimentary sets (1961), as well as Hisao Yamada's paper on real-time computations (1962).
Earlier papers studying problems solvable by Turing machines with specific bounded resources include John Myhill's definition of linear bounded automata (Myhill nineteen sixty), Raymond Smullyan's study of rudimentary sets (nineteen sixty-one), as well as Hisao Yamada's paper on real-time computations (nineteen sixty-two).
In what year did Raymond Sullivan publish a study of rudimentary sets?