MAXIMAL DEPTHS OF BOOLEAN FUNCTIONS

Authors

  • Dimiter Skordev

Keywords:

algorithmic computability, Boolean function, complete set, maximal depth, Post theorem

Abstract

Given any Boolean function, there is an upper bound of its depths with respect to arbitrary complete sets of such functions. We prove the algorithmic computability of the largest of these depths.

Downloads

Published

2004-12-12

Issue

Vol. 96 (2004): Ann. Sofia Univ. Fac. Math and Inf.

Section

Articles

How to Cite

MAXIMAL DEPTHS OF BOOLEAN FUNCTIONS. (2004). Annual of Sofia University St. Kliment Ohridski. Faculty of Mathematics and Informatics, 96, 89-99. https://annual.uni-sofia.bg/index.php/fmi/article/view/164