The hydra battle revisited

Authors:
Nachum Dershowitz;Georg Moser
Affiliations:
School of Computer Science, Tel Aviv University, Ramat Aviv, Israel and Microsoft Research, Redmond, WA;Institute of Computer Science, University of Innsbruck, Innsbruck, Austria
Venue:
Rewriting Computation and Proof
Year:
2007

Citing 14
Cited 0

Open problems in rewriting

RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Rewrite systems

Handbook of theoretical computer science (vol. B)
Natural termination

RTA-93 Selected papers of the fifth international conference on Rewriting techniques and applications
Term rewriting and all that

Term rewriting and all that
Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
Is Sometimes Ever Better Than Always?

ACM Transactions on Programming Languages and Systems (TOPLAS)
Death of a monster

ACM SIGACT News
Modular termination proofs for rewriting using dependency pairs

Journal of Symbolic Computation
Encoding the Hydra Battle as a Rewrite System

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Trees, Ordinals and Termination

TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Examples of Termination

Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course
Relating derivation lengths with the slow-growing hierarchy directly

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Die another day

FUN'07 Proceedings of the 4th international conference on Fun with algorithms
The termination competition

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Showing termination of the Battle of Hercules and Hydra is a challenge. We present the battle both as a rewrite system and as an arithmetic while program, provide proofs of their termination, and recall why their termination cannot be proved within Peano arithmetic.