Algorithmic Problem Complexity
Published in ArXiv.org • Jul 4, 2008
Authors:
Mark Burgin
Abstract
People solve different problems and know that some of them are simple, some are complex and some insoluble. The main goal of this work is to develop a mathematical theory of algorithmic complexity for problems. This theory is aimed at determination of computer abilities in solving different problems...
Subject
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!