- #1

- 2,844

- 0

Can anyone here help me locate this paper (given the reference), or alternately communicate the result to me? The paper is only four pages long, so that's an upper bound on the complexity of the function. Thanks.

M. W. Green. "A lower bound on Rado's Sigma function for binary Turing machines".

*Switching Circut Theory and Logical Design, Proceedings of the Fifth Annual Symposium*(1964), pp. 91-94.