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

Post's Problem for Reducibilities of Bounded Complexity

โœ Scribed by Valeriy K. Bulitko

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
154 KB
Volume
48
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On existence of complete sets for bounde
On existence of complete sets for bounded reducibilities
โœ Valeriy Bulitko; Vadim Bulitko ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 165 KB

## Abstract Classical reducibilities have complete sets __U__ that any recursively enumerable set can be reduced to __U__. This paper investigates existence of complete sets for reducibilities with limited oracle access. Three characteristics of classical complete sets are selected and a natural hi

Generalized solution of interdiffusion p
Generalized solution of interdiffusion problem: Optimal approach for multicomponent bounded systems
โœ Danielewski, M.; Filipek, R. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 797 KB

Darken's phenomenological scheme for diffusion in binary systems is used for a description of interdiffusion in multicomponent ( r 2 2) mixtures. The mathematical model of interdiffusion in the bounded mixture (i.e., layer of finite thickness) showing constant concentration (e.g., in solid or liquid

On the Isomorphism Problem for Finite Ca
On the Isomorphism Problem for Finite Cayley Graphs of Bounded Valency
โœ C.H. Li; C.E. Praeger ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 187 KB

For a subset S of a group G such that 1 / โˆˆ S and S = S -1 , the associated Cayley graph Cay(G, S) is the graph with vertex set G such that {x, y} is an edge if and only if yx -1 โˆˆ S. Each ฯƒ โˆˆ Aut(G) induces an isomorphism from Cay(G, S) to the Cayley graph Cay(G, S ฯƒ ). For a positive integer m, th