The network complexity and the Turing machine complexity of finite functions

Summary

Let L(f) be the network complexity of a Boolean function L(f). For any n-ary Boolean function L(f) let \(TC(f) = min\{ T_p^{\bar A} (n){\text{ (}}\parallel p\parallel + 1gS_p^{\bar A} {\text{(}}n{\text{):}}res_p^{\bar A} {\text{(}}n{\text{) = }}f\} \). Hereby p ranges over all relative Turing programs and Ā ranges over all oracles such that given the oracle Ā, the restriction of p to inputs of length n is a program for L(f). ∥p∥ is the number of instructions of p. T p Ā(n) is the time bound and S p Āof the program p relative to the oracle Ā on inputs of length n. Our main results are (1) L(f) ≦ O(TC(L(f))), (2) TC(f) ≦ O(L(f) 2 2+ɛ) for every ɛ ⋙ O.

This is a preview of subscription content, access via your institution.

References

  1. 1.

    Fischer, M. J.: Lectures on network complexity. Preprint Universität Frankfurt, June 1974

  2. 2.

    Hennie, F. C., Stearns, R. E.: Two tape simulation of multitape turing machines. J. ACM 13, 533–546 (1966)

    Google Scholar 

  3. 3.

    Lupanov, O. B.: Complexity of formula realisation of functions of logical algebra. Prob. Cybernetics 3 (1962)

  4. 4.

    Paterson, M. S., Fischer, M. J., Meyer, A. R.: An improved overlap argument for on-line multiplication. In: Complexity of Computation. SIAM AMS Proceedings 7, 97–111 (1974)

    Google Scholar 

  5. 5.

    Savage, J. E.: Computational work and time on finite machines. J. ACM 19, 660–674 (1972)

    Google Scholar 

  6. 6.

    Schnorr, C. P.: Lower bounds for the product of time and space requirements of Turing machine computations. Proc. Symposium on the Mathematical Foundations of Computer Science 1973, High Tatras. CSSR, Math. Inst. Slovak Academy of Sciences 1973, P. 153–161

Download references

Author information

Affiliations

Authors

Additional information

The results of this paper have been reported in a main lecture at the 1975 annual meeting of GAMM, April 2–5, Göttingen

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Schnorr, C.P. The network complexity and the Turing machine complexity of finite functions. Acta Informatica 7, 95–107 (1976). https://doi.org/10.1007/BF00265223

Download citation

Keywords

  • Information System
  • Operating System
  • Data Structure
  • Communication Network
  • Information Theory