Mathematical Logic QuarterlyVolume 32, Issue 19-24 p. 377-384 Article A Gödel Theorem on Network Complexity Lower Bounds C. P. Schnorr, C. P. Schnorr Universität Frankfurt FB Mathematik PSF 11 1932 D-60000 Frankfurt a. M. B.R.D. Search for more papers by this author C. P. Schnorr, C. P. Schnorr Universität Frankfurt FB Mathematik PSF 11 1932 D-60000 Frankfurt a. M. B.R.D. Search for more papers by this author First published: 1986 https://doi.org/10.1002/malq.19860321912Citations: 4 Research performed while at the University of California, Berkeley, Computer Science Division, supported by NSF grant (21828). I would like to thank M. Blum and the Computer Science Department of Berkeley University for their hospitality while this paper was written. It is a pleasure to acknowledge the stimulating interest and helpful suggestions from many colleagues. Specific mention must be made of Prof. M. Blum of Berkeley University and of J. Lagarias of ATT, Bell Laboratories. The proof of theorem 4 has been suggested by R. Solovay of Berkeley University. AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Citing Literature Volume32, Issue19-241986Pages 377-384 RelatedInformation