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.
Aug 8, 1995
Abstract. Bennett's pebble game [1, 2] was introduced to obtain better time/space tradeo s in the simulation of standard Turing machines by reversible ones.
Aug 13, 2018 · Bibliographic details on An analysis of Bennett's pebble game.
People also ask
What is the Pebble game theory?
How to write an analysis of a game?
What is the game with the pebbles?
Which game do we use pebbles when we play?
Duration: 2:29:12
Posted: Mar 21, 2024
Posted: Mar 21, 2024
Reversible simulation of irreversible algorithms is analyzed in the stylized form of a `reversible' pebble game. The reacheable reversible simulation ...
Abstract: Reversible simulation of irreversible algorithms is analyzed in the stylized form of a `reversible' pebble game. While such simulations incur little ...
We study the connection between pebble games and complexity. First ... pebble game of Bennett have the same pebble costs over any directed acyclic graph.
Missing: analysis | Show results with:analysis
The minimum number of pebbles required to pebble a DAG using reversible pebble game by Bennett is termed as the reversible pebble number of the graph.
Missing: analysis | Show results with:analysis
It is proved that the problem of deciding whether s pebbles suffice to reversibly pebble a DAG G is PSPACE-complete, and it is established that both ...
To analyze such trade-offs we use Bennett's brief suggestion in [Bennett, 1989] that a reversible simulation can be modelled by the following 'reversible ...