1686 search results - page 1 / 338 » Programs as polygraphs: computability and complexity |
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
FOGA
2011
12 years 8 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
SAS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
IWPEC
2010
Springer
13 years 2 months ago
2010
Springer
CASES
2009
ACM
13 years 2 months ago
2009
ACM
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...