David Rostcheck, 9/1/2022

This note expands the basic analysis articulated in Introducing Broad Information Theory: A Cross-Domain Informational Framework into a more nuanced algorithm:


graph TD
  A[Identify a pattern in a domain]
  A --> B[Search for and identify parallel patterns in other domains]
  B --> C[Refine the identified pattern, identifying structure and substructure]
  C -->|Refinement Loop| B
  C --> D[Form theses for test]
  D --> E[Form computational simulations to test those theses]
  E --> F[Extract general principles from the simulations]
  F --> G[Form a more complete and more general theory]
  G --> H[Provide predictions for further validation and refinement]
  H -->|Prediction-Testing Loop| E
  H --> I{Sufficient?}
  I -->|Yes| J[End]
  I -->|No| B

Diagram by ChatGPT 4.0

The general flow of a Broad Information Theoretical analysis is:

  1. Identify a pattern in a domain
  2. Search for and identify parallel patterns in other domains
  3. Refine the identified pattern, identifying structure and substructure, by cross-correlating and contrasting observations:
  4. Form theses for test:
  5. Form computational simulations to test those theses:
  6. Extract general principles from the simulations:
  7. With the principles observed, seek to form a more complete and more general theory. Where possible it should produce testable predictions in other domains for further validation and refinement.
  8. A pattern is sufficiently well-characterized when we stop finding significant improvements to it structure. At this point it can cataloged as a known common solution to a known informational problem.