1. On the number of multiplications necessary to compute certain functions
2. Characterizations of flowchartable recursions
3. On computable numbers with an application to the Entscheidung-sproblem;Turing;Proceedings of the London Mathematical Society,1936
4. Anush Tserunyan [2013] (1) Finite generators for countable group actions; (2) Finite index pairs of equivalence relations; (3) Complexity measures for recursive programs, Ph.D. Thesis , University of California, Los Angeles, Kechris, A. and Neeman, I., supervisors. 118, 121, 123.
5. ON THE NUMBER OF MULTIPLICATIONS REQUIRED TO COMPUTE CERTAIN FUNCTIONS