Graph-theoretic and Physical Account of Binary versus Ternary Branching Structure in Human Natural Language Computation

• ARIKAWA Koji

抄録

We demonstrate that information loss (error) is minimized in a binary branching network from linear-algebraic (graph-theoretic) and physical perspectives. Nature organizes the network currents to minimize heat loss. Nature has created the human brain, and a set of computational procedures of human natural language (CHL) exists in the human brain. A natural object CHL conforms with the principle of minimal computation (MC) and chooses binary branching structures rather than ternary branching structures. MC prefers efficient (less costly) computation. More information is conserved in the binary branching network. Binary branching structures, and not ternary branching structures, conform with the conservation law. Information means energy, forces, or heat from an engineering perspective. Moreover, we have graphtheoretic (linear-algebraic) and physical reasons for concluding that the syntactic operation merge in CHL must be binary, and not ternary.

収録刊行物

• 桃山学院大学総合研究所紀要 = St. Andrew's University bulletin of the Research Institute / 桃山学院大学総合研究所 編

  桃山学院大学総合研究所紀要 = St. Andrew's University bulletin of the Research Institute / 桃山学院大学総合研究所 編 41 (2), 79-108, 2015-12

  桃山学院大学総合研究所

キーワード

• C[HL]
• equilibrium (balance)
• graph theory
• linear algebra
• MC

詳細情報

• CRID: 1050860764322019840
• NII論文ID: 110009989000
• NII書誌ID: AA11337282
• ISSN: 1346048X
• NDL書誌ID: 027052402
• Web Site: https://stars.repo.nii.ac.jp/records/2000412
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I027052402
• 本文言語コード: ja
• 資料種別: departmental bulletin paper
• データソース種別:
  • IRDB
  • NDL
  • CiNii Articles