An analysis of Bennett's pebble game
Combinatorics
2016-09-06 v1 Computational Complexity
Abstract
Bennett's pebble game was introduced to obtain better time/space tradeoffs in the simulation of standard Turing machines by reversible ones. So far only upper bounds for the tradeoff based on the pebble game have been published. Here we give a recursion for the time optimal solution of the pebble game given a space bound. We analyze the recursion to obtain an explicit asymptotic expression for the best time-space product.
Cite
@article{arxiv.math/9508218,
title = {An analysis of Bennett's pebble game},
author = {Emanuel Knill},
journal= {arXiv preprint arXiv:math/9508218},
year = {2016}
}
Comments
15 pages