๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation

โœ Scribed by Klaus Meer; Martin Ziegler


Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
431 KB
Volume
9
Category
Article
ISSN
1615-3375

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Exact computation of infimum for a class
โœ Ben M Chen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 549 KB

A noniterative me~:hod for the computation of infimum for a class of continuous-time Ho~ optimal control problem is considered in this paper. The problem formulation is fairly general and does not place any restrictions on any direct feedthrough terms of' the given systems. The method is applicable