𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computable scenes and structures in films

✍ Scribed by Sundaram, H.; Shih-Fu Chang,

Book ID
120170369
Publisher
IEEE
Year
2002
Tongue
English
Weight
373 KB
Volume
4
Category
Article
ISSN
1520-9210

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computable structures and the hyperarith
Computable structures and the hyperarithmetical hierarchy
✍ C.J. Ash, J. Knight πŸ“‚ Library πŸ“… 2000 πŸ› Elsevier 🌐 English βš– 2 MB

This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean alge

Degree spectra and computable dimensions
Degree spectra and computable dimensions in algebraic structures
✍ Denis R. Hirschfeldt; Bakhadyr Khoussainov; Richard A. Shore; Arkadii M. Slinko πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 339 KB

Whenever a structure with a particularly interesting computability-theoretic property is found, it is natural to ask whether similar examples can be found within well-known classes of algebraic structures, such as groups, rings, lattices, and so forth. One way to give positive answers to this questi

Higher-order structures in natural scene
Higher-order structures in natural scenes
✍ Takuma Tanaka; Toshio Aoyagi; Takeshi Kaneko πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 82 KB
On the complexity of categoricity in com
On the complexity of categoricity in computable structures
✍ Walker M. White πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 192 KB

## Abstract We investigate the computational complexity the class of Γ‐categorical computable structures. We show that hyperarithmetic categoricity is Ξ ^1^~1~‐complete, while computable categoricity is Ξ ^0^~4~‐hard. (Β© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)