A technique is presented for reducing an arbitrary machine S as much as possible to a machine T which can do everything (from the input-output point of view) that S can do. Since the technique is always applicable, it is more powerful (although more cumbersome) than the well-known merging technique. Several examples are given.
No takes yet. Share an insight, caveat, or question.
Seymour Ginsburg (1959) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: