WOLFRAM NOTEBOOK

WOLFRAM|DEMONSTRATIONS PROJECT

Integrated Information in Partitioned Boolean Nets

​
Boolean net general parameters and type of analysis
number of nodes
2
3
4
number of Boolean function arguments
1
2
type of analysis
cause
effect
Boolean net state, topology and functions
node set partition
node
state
function arguments (input nodes)
function truth table
first
second
(0,0)(0,1)(1,0)(1,1)
1
1
2
3
4
1
2
3
4
2
1
2
3
4
1
2
3
4
3
1
2
3
4
1
2
3
4
4
1
2
3
4
1
2
3
4
{{1},{2},{3},{4}}
Boolean net graph
information measures
global
cause
information:
0.
local
cause
information
for partition components:
{0.,0.,0.,0.}
integrated
cause
information
for partition:
0.
An
(n,k)
Boolean net is a sequential, synchronous, dynamical system that can be represented by an
n
-node directed graph. Each node
x
is associated with a Boolean function
f
x
of
k
Boolean arguments that defines the node value at each clock tick. The arguments of
f
x
are provided by the nodes connected to
x
by the incoming arcs. You can define the number
n
of nodes of the net, the arity
k
of the functions, and the state and the specific function of each node; you can select a partition of the node set and choose between two types of analysis: "cause" or "effect". Based on these settings, the Demonstration computes both global and partition-dependent information as defined in Integrated Information Theory v2.0 (see details below).
Wolfram Cloud

You are using a browser not supported by the Wolfram Cloud

Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.


I understand and wish to continue anyway »

You are using a browser not supported by the Wolfram Cloud. Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.