## Abstract This paper gives an implicit characterization of the class of functions computable in polynomial space by deterministic Turing machines β PSPACE. It gives an inductive characterization of PSPACE with no adβhoc initial functions and with only one recursion scheme. The main novelty of thi
Characterizing NC with tier 0 pointers
β Scribed by Isabel Oitavem
- Book ID
- 102483031
- Publisher
- John Wiley and Sons
- Year
- 2004
- Tongue
- English
- Weight
- 130 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
A twoβsorted term system characterizing NC implicitly is described. The term system is defined over the tree algebra π, the free algebra generated by 0, 1 and βοΈ, and the recursion scheme uses pointers over tier 0. This differs from previous characterizations of NC, where tier 1 pointers were used or full parameter substitution over tier 0 was allowed. (Β© 2003 WILEYβVCH Verlag GmbH & Co. KGaA, Weinheim)
π SIMILAR VOLUMES
Ab initio density functional theory (DFT) was employed to study reconstructions of diamond (1 0 0) surfaces in the presence of hydrogen, oxygen and hydroxyl. Clean and (2 Γ 1):1H surfaces are taken as reference. The properties of oxidization diamond surfaces with several adsorption structures, namel