Chaos in Binary Category Computation

21 Pages Posted: 16 Nov 2010

Date Written: November 15, 2010


Category computation theory deals with a web-based systemic processing that underlies the morphic webs, which constitute the basis of categorial logical calculus. It is proven that, for these structures, algorithmically incompressible binary patterns can be morphically compressed, with respect to the local connectivities, in a binary morphic program. From the local connectivities, there emerges a global morphic connection that can be characterized by a low length binary string, leading to the identification of chaotic categorial dynamics, underlying the algorithmically random pattern. The work focuses on infinite binary chains of C2, which is a category that implements an X-OR-based categorial logical calculus.

Keywords: Category Computation Theory, Category, Algorithmic Incompressibility, Emergence, Chaos

Suggested Citation

Gonçalves, Carlos Pedro dos Santos, Chaos in Binary Category Computation (November 15, 2010). Available at SSRN: or

Carlos Pedro dos Santos Gonçalves (Contact Author)

Political and Strategic Studies Institute (ISCSP-IEPE) ( email )

Pólo Universitário do Alto da Ajuda
Rua Almerindo Lessa
Lisbon - Lisboa, 1349-055


Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Abstract Views
PlumX Metrics