Kaydedildi:
| Yazar: | |
|---|---|
| Materyal Türü: | Recurso digital |
| Dil: | İngilizce |
| Baskı/Yayın Bilgisi: |
Zenodo
2025
|
| Konular: | |
| Online Erişim: | https://doi.org/10.5281/zenodo.17594076 |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|
İçindekiler:
- <p>This paper introduces a formal framework for hierarchical computation using projection and collapse operators that form an adjunction between finite machines. A behavioral metric is defined to measure cross-level similarity and shown to satisfy metric properties. The framework includes proofs of metric completion, examples using binary linear codes, and an efficient level-assignment algorithm. Connections are drawn to finite cursor machines, descriptive complexity, and information theory, providing a compact and computable account of hierarchical processing.</p>