Systems of Systems Complexity Set

1.1. What This Book is About This book is a study of • subrecursive programming systems, • efficiency/program-size trade-offs between such systems, and • how these systems can serve as tools in complexity theory. Section 1.1 states our basic themes, and Sections 1.2 and 1.3 give a general outline of the book. Our first task is to explain what subrecursive programming systems are and why they are of interest. 1.1.1. Subrecursive Programming Systems A subrecursive programming system is, roughly, a programming language for which the result of running any given program on any given input can be completely determined algorithmically.

Learn all the ideas, methods and tools you need to become a systems innovator with this 17-week online crash course

by Carl Belack (Author), Daniele Di Filippo (Author), Ivano Di Filippo (Author)
Issues surrounding business complexity plague organizations throughout the world. This situation is particularly true of the numerous complex projects and programs upon which organizations embark on a regular basis