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

How to Cite

Skordev, D. (2004). MAXIMAL DEPTHS OF BOOLEAN FUNCTIONS. Ann. Sofia Univ. Fac. Math. And Inf., 96, 89–99. Retrieved from https://annual.uni-sofia.bg/index.php/fmi/article/view/164

Issue

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

Section

Articles