vignettes/man_size_of_big_a_i_1.R

#' The size of \eqn{\mathbb{A}^{i,1}}
#'
#' \strong{Question} \cr
#' How many possible algorithms exist in \eqn{\mathbb{A}^{i,1}} ? \cr
#' Formally: \eqn{|\mathbb{A}^{i,1}|}. \cr
#' \cr
#' \strong{Answer} \cr
#' By definition, a truth table algorithm \eqn{a \in \mathbb{A}^{i,1}} has a size of \eqn{1 \times 2^{i}}. \cr
#' Hence, there are as many algorithms in \eqn{\mathbb{A}^{i,1}} than there are combinations of \eqn{2^{i}}. \cr
#' In conclusion, there are \eqn{2^{2^{i}}} algorithms in \eqn{\mathbb{A}^{i,1}}.
#'
#' @name size_of_big_a_i_1
NULL
daviddoret/haricot documentation built on May 21, 2019, 1:42 a.m.