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

Computational complexity of formal translations

โœ Scribed by J. Hartmanis

Publisher
Springer
Year
1974
Tongue
English
Weight
801 KB
Volume
8
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Degrees of computational complexity
Degrees of computational complexity
โœ H.B. Enderton ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 316 KB

We consider a measure ~b of computational complexity. The measure 9 determines a binary relation on the recursive functions; F is no harder to compute than G iff for every index g of G there is an index f off such that for nearly all x, the difficulty off at x (as measured by ~) is no more than the

Formal aspects of egress complexity
Formal aspects of egress complexity
โœ H.A. Donegan; T.B.M. McMaster ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 742 KB

Egress complexity is concerned with the summative uncertainty experienced by a naive occupant of a building when faced with a challenge to evacuate without the assistance of signage. This paper takes the present model of egress complexity and recasts its basic initiative in terms of elementary order