9 citations · 18 across the 5 of their papers we have counts for
Showing 2004Show all
3 papers · 1 filter
cs.CC2004
Hardware-Oriented Group Solutions for Hard Problems
Mark Burgin
Group and individual solutions are considered for hard problems such as satisfiability problem. Time-space trade-off in a structured active memory provides means to achieve lower t…
math.LO2004★ 1 cited
Axiomatic Theory of Algorithms: Computability and Decidability in Algorithmic Classes
Mark Burgin
Axiomatic approach has demonstrated its power in mathematics. The main goal of this preprint is to show that axiomatic methods are also very efficient for computer science. It is p…
math.LO2004★ 6 cited
Unified Foundations for Mathematics
Mark Burgin
There are different meanings of foundation of mathematics: philosophical, logical, and mathematical. Here foundations are considered as a theory that provides means (concepts, stru…