- Blum,L; Cucker,F; Shub,M; Smale,S;
**1996**, Complexity and Real Computation: A Manifesto,*International Journal of Bifurcation and Chaos*,**6**, 3-26 - Subramanian,A;
**1995**, The Parallel Complexity of Propagation in Boolean Circuits,*Information and computation*,**117**, 266 - Pattee,H;
**1995**, Evolving self-reference: matter, symbols and semantic closure,*Communication and Cognition - Artificial Intelligence*,**12**, 9-27 - Meer,K;
**1995**, On the Relations Between Discrete and Continuous Complexity Theory,*Mathematical Logic Quarterly*,**41**, 281-286 - Hemmerling,A;
**1995**, On Genuine Complexity and Kinds of Nondeterminism,*Journal of information processing and cybernetics*,**30**, 77 - Gell-Mann,M;
**1995**, What is Complexity?,*Complexity*,**1**, 16-19 - Edmonds,B;
**1995**, What is Complexity? - the philosophy of complexity per se with application to some examples in evolution, To be published in: F. Heylighen & Aerts (eds.): The Evolution of Complexity, Kluwer, Dordrecht. Also available http://bruce.edmonds.name/evolcomp/ - Sanderson,WC;
**1994**, Predictability, Complexity and Catastophe in a Collpsible Model of Population, Development, and Environmental Interactions, International Institute for Applied Systems Analysis - Conklin,D; Witten,IH;
**1994**, Complexity-Based Induction,*Machine Learning*,**16**, 203 - Hromkovic,J; Kari,J; Kari,L;
**1994**, Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems,*Theoretical Computer Science*,**127**, 123-147 - Darley,V;
**1994**, Emergent Phenomena and Complexity, Alife IV, also available electronically - Akman,V; Pakkan,M;
**1994**, Nonstandard Set Theories and Information Management, Obtainable by ftp from here - Gallo,G; Longo,G; Pallottino,S; Sang Nguyen;
**1993**, Directed Hypergraphs and Applications,*Discrete Applied Mathematics*,**42**, 177-201 - Holm,HJ;
**1993**, Complexity in Economic Theory, University of Lund: Lund Economic Studies, Lund, Sweden - Cooper,C;
**1993**, Complexity in C3I Systems,*Complexity International*,**1**, 7 - Steel,M;
**1992**, The Complexity of Reconstructing Trees from Qualitative Characters and Subtrees,*Journal of Classification*,**1992**, 91-116 - Zuse,H;
**1991**, Software Complexity, Walter de Gruyter, Berlin - Traub,JF; Wozniakowski,H;
**1991**, Information-Based Complexity: New Questions for Mathematicians,*Mathematical Intelligencer*,**13**, 34-43 - Lopez,LR; Caufield,LJ;
**1991**, A Principle of Minimum Complexity in Evolution,*Lecture Notes in Computer Science*,**496**, 405-409 - Rustem,B; Velupillai,K;
**1990**, Rationality, Computability and Complexity,*Journal of Economic Dynamics and Control*,**14**, 419-432 - Turney,P;
**1990**, Problems with Complexity in Gold's Paradigm of Induction-Part I: Dynamic Complexity,*International Journal of General Systems*,**17**, 329-342 - Burgin,MS;
**1990**, Generalised Kolmogorov Complexity and other dual Complexity Measures,*Cybernetics*,**26**, 481-491 - Balcazar,JL;
**1990**, Structural Complexity, Springer-Verlag, Berlin - Balcazar,JL;
**1990**, Structural Complexity, Springer-Verlag, Berlin - Turney,P;
**1989**, The Architecture of Complexity: A new blueprint,*Synthese*,**79**, 515-542 - Grassberger,P;
**1989**, Problems in Quantifying Self-organized complexity,*Helvetica Physica Acta*,**62**, 498-511 - B”rger,E;
**1989**, Computability, Complexity, Logic, North Holland, Amsterdam - Traub,JF; Wasilkowski,GW; Wozniakowski,H;
**1988**, Information-Based Complexity, Academic Press, London - Serra,R;
**1988**, Some Remarks on Different Measures of Complexity for the Design of Self-organising Systems, in*Cybernetics and Systems '88*, Eds.Trappl,R; , Klumer Academic, Dordrecht, pages 141-148 - Levesque,HJ;
**1988**, Logic and the Complexity of Reasoning,*Journal of Philosophical Logic*,**17**, 355-389 - Kelly,JS;
**1988**, Social Choice and Computatational Complexity,*Journal of Mathematical Economics*,**17**, 1-8 - Bennett,CH;
**1988**, Logical Depth and Physical Complexity, in*The Universal Turing Machine, A Half-Century Survey*, Eds.Herken,R; , Oxford University Press, Oxford, pages 227-257 - Girard,JY;
**1987**, Linear Logic,*Theoretical Computer Science*,**50**, 1-102 - McMullen,C; Shearer,J;
**1986**, Prime Implicants, Minimum Cover and the Complexity of Logic Simplification,*IEEE Transactions on Computers*,**35**, 761-762 - Traub,JF; Wasilkowski,GW; Wozniakowski,H;
**1983**, Information, Uncertainty, Complexity, Addison-Wesley, Reading, MA - Aaderaa,SO; B”rger,E;
**1981**, The equivalence of Horn and network complexity of Boolean functions,*Acta Informatica*,**15**, 303-307 - Hopcroft,JE; Ullman,JD;
**1979**, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Massachusetts - Aaderaa,SO; B”rger,E;
**1979**, The Horn Complexity of Boolean functions and Cook's problem, in*Proceedings of the 5th Scandanavian Logic Symposium*, Eds.Mayoh,B; Jensen,F; , Aalborg University Press, Aalborg, pages 231-256 - Sahal,D;
**1976**, Elements of an Emerging theory of Complexity Per Se,*Cybernetica*,**19**, 5-38 - Yudin,D; Goryashko,A;
**1975**, Control problems and Complexity Theory II,*Engineering Cybernetics (USSR)*,**13**, 1-13 - Blum,L; Blum,M;
**1975**, Toward a Mathematical Theory of Inductive Inference,*Information and Control*,**35**, 125-155 - De Luca,A;
**1975**, Complexity and Information Theory, in*Coding and Complexity*, Eds.G.Longo; , Springer-Verlag, Berlin, pages 207-270 - Yudin,D; Goryashko,A;
**1974**, Control problems and Complexity Theory I,*Engineering Cybernetics (USSR)*,**12**, 10-24 - Lofgren,L;
**1974**, Complexity of Descriptions of Systems: A foundational Study,*International Journal of General Systems*,**3**, 197-214 - Simon,HA;
**1973**, The Organization of Complex Systems, in*Hierarchy Theory - The Challenge of Complex Systems*, Eds.Pattee,HH; , Goerge Braziller, New York, pages 1-27 - Feldman,JA;
**1972**, Some decidability results on grammatical inference and complexity,*Information and Control*,**20**, 244-262 - Ausiello,G;
**1971**, Abstract Computational Complexity and Cycling Computations,*Journal of Computer and System Sciences*,**5**, 118-128 - Meyer,AR; Ritchie,DM;
**1967**, The Complexity of Loop Programs, in*Proceedings of the 22nd National Conference*, Eds., Thompson Book Company, Washington DC, pages 465-469 - Blum,M;
**1967**, A Machine Independant Theory of the Complexity of Recursive Functions,*Journal of the Association of Computing Machinery*,**14**, 322

Bruce Edmonds, Centre for Policy Modelling, Manchester Metropolitan University