Jung's Theory of Personality

A complete treatment of fundamentals and recent advances in complexity theory Complexity theory studies the inherent difficulties of solving algorithmic problems by digital computers. This comprehensive work discusses the major topics in complexity theory, including fundamental topics as well as recent breakthroughs not previously available in book form. Theory of Computational Complexity offers a thorough presentation of the fundamentals of complexity theory, including NP-completeness theory, the polynomial-time hierarchy, relativization, and the application to cryptography.

We present in this book a view of the Geometric Theory of Dynamical Systems, which is introductory and yet gives the reader an understanding of some of the basic ideas involved in two important topics: structural stability and genericity.

he present book and its companion volume The Tenseless Theory of Time: a T Critical Examination are an attempt to adjudicate what one recent discussant has called "the most fundamental question in the philosophy of time," namely, "whether a static or a dynamic conception of the world is correct.

This book is concerned with the development of the understanding of the relational structures of information, knowledge, decision–choice processes of problems and solutions in the theory and practice regarding diversity and unity principles of knowing, science, non-science, and information–knowledge systems through dualistic-polar conditions of variety existence and nonexistence. It is a continuation of the sequence of my epistemic works on the theories on fuzzy rationality, info-statics, info-dynamics, entropy, and their relational connectivity to information, language, knowing, knowledge, cognitive practices relative to variety identification–problem–solution dualities, variety transformation–problem–solution dualities, and variety certainty–uncertainty principle in all areas of knowing and human actions regarding general social transformations.

Theory of Computation is a unique textbook that serves the dual purposes of covering core material in the foundations of computing, as well as providing an introduction to some more advanced contemporary topics. This innovative text focuses primarily, although by no means exclusively, on computational complexity theory: the classification of computational problems in terms of their inherent complexity. It incorporates rigorous treatment of computational models, such as deterministic, nondeterministic, and alternating Turing machines; circuits; probabilistic machines; interactive proof systems; automata on infinite objects; and logical formalisms. Although the complexity universe stops at polynomial space in most treatments, this work also examines higher complexity levels all the way up through primitive and partial recursive functions and the arithmetic and analytic hierarchies.