436 Hits in 3.0 sec

Page 1977 of Mathematical Reviews Vol. , Issue 90D [page]

1990 Mathematical Reviews  
B. (1-UCSD) Classification of degree classes associated with r.e. subspaces. Ann. Pure Appl. Logic 42 (1989), no. 2, 105-124.  ...  The two natural classes of £, e-degrees are the I], e-degrees (coinciding with the degrees of characteristic functions of r.e. sets) and the class A?  ... 

Degrees of splittings and bases of recursively enumerable subspaces

R. G. Downey, J. B. Remmel, L. V. Welch
1987 Transactions of the American Mathematical Society  
For an r.e. subspace V of Voo , we show that O! is the degree of an r.e. basis of V iff O! is the degree of an r.e. summand of V iff O! is the degree and dependence degree of an r.e. summand of V.  ...  This paper analyzes the interrelationships between the (Turing) of r.e. bases and of r.e. splittings of r.e. vector spaces together with the relationship of the degrees of bases and the degrees of the  ...  The proof of this result uses a class of r.e. subspaces, the strongly atomic ones, whose r.e. set analogues have proved very useful in studying splitting properties of r.e. sets and degree embeddings (  ... 
doi:10.1090/s0002-9947-1987-0891641-4 fatcat:xhaymjxi3bgglhjz6bwxergbte

Master index to volumes 41-50

1990 Annals of Pure and Applied Logic  
of degree classes associated with r.e. subspaces 42 (1989) 105-124 Downey, R.G. and Slaman, T.A., Completely mitotic r.e. degrees 41(1989) 119-152 Downey, R.G., see Chong, CT. 48 (1990) 215-225  ...  lattices of r.e.  ... 
doi:10.1016/0168-0072(90)90061-6 fatcat:inapyhmvyffpzkhhdq4qje4ahi

Page 5 of Mathematical Reviews Vol. , Issue 81K [page]

1981 Mathematical Reviews  
of interest in connection with the decidability problem of fragments of the elementary theory of &(a) and th classification problem of orbits under Aut & (a), the group of auto. morphisms of &(a).  ...  The lattice &(V,,) of recursively enumerable (r.e.) subspaces of an effective countably infinite-dimensional vector space V,, has been extensively studied by the authors [Ann. Math.  ... 

Computational Processes and Incompleteness

Klaus Sutner
2009 Electronic Proceedings in Theoretical Computer Science  
There is a natural classification of these processes into decidable, intermediate and complete.  ...  We introduce a formal definition of Wolfram's notion of computational process based on cellular automata, a physics-like model of computation.  ...  Thus, the whole complexity of the upper semi-lattice R of the r.e. degrees is fully reflected in this classification of cellular automata.  ... 
doi:10.4204/eptcs.1.22 fatcat:kynfeesiufgufpxouisra57ryi

JSL volume 4 issue 3 Cover and Back matter

1978 Journal of Symbolic Logic (JSL)  
The Association assesses page charges at the rate of $30.00 per page for all papers (excluding reviews) that appear in the JOURNAL.  ...  Authors receive fifty reprints of each article, with covers, and additional reprints may be purchased if desired.  ...  Saturated ideals 65 LEGGETT, ANNE. a-Degrees of maximal a-r.e. sets 456 LIH, KO-WEI. Type two partial degrees 623 MAASS, WOLFGANG.  ... 
doi:10.1017/s0022481200049112 fatcat:5uge6owjc5auniwdwwckypbxni

Computational processes, observers and Turing incompleteness

Klaus Sutner
2011 Theoretical Computer Science  
The Turing degrees of r.e. sets together with the order induced by Turing reducibility form a partial order, and in fact an upper semi-lattice R.  ...  Post asked whether there are any other r.e. degrees and embarked on a program to establish the existence of such an intermediate degree by constructing a suitable r.e. set.  ...  Thus, the whole complexity of the upper semi-lattice R of the r.e. degrees is fully reflected in this classification of cellular automata.  ... 
doi:10.1016/j.tcs.2010.09.004 fatcat:d6q75rzlcbbftdaemfyyjqsgsm

The topology of provability in complexity theory

Kenneth W. Regan
1988 Journal of computer and system sciences (Print)  
Section 7 explains how open problems such as NP 1 P or NP p co-NP reflect questions about the connectedness of certain classes as subspaces of 3. In conclusion we assess the usefulness of !  ...  We provide diagrams for these results, meanwhile coping with the fact that the underlying topology Yl differs greatly from that of the Euclidean plane.  ...  Strings, Numbers, Functions, Sets, and Classes Taking E := (0, 1 }, we identify C* with N + by associating to each string x the number bin(x) having binary representation lx.  ... 
doi:10.1016/0022-0000(88)90036-0 fatcat:3vosgewowva5phw6nftpy62qky

On turing degrees of Walrasian models and a general impossibility result in the theory of decision-making

Alain A. Lewis
1992 Mathematical Social Sciences  
Associated with every model 'X a i^ '^o"'® \&B}^ of (/{^g* i-e-generate winning strategies, equilibrium points, optimal choices, stable outcomes, etc.  ...  -JY $ acts a space of alternatives to a space of outcomes for (^g« Let degC/f ) be the Turing degree of computational complexity of the realization of $.  ...  The distinction between the degree of presentation of a structure ^ _ and the Turing degree of the realization of the task associated with the structure ^ is a necessary distinction.  ... 
doi:10.1016/0165-4896(92)90060-i fatcat:wnnmdlbftvbvlfgswzc7lev4gm

Progressive promoter element combinations classify conserved orthogonal plant circadian gene expression modules

S. P. Smieszek, H. Yang, A. Paccanaro, P. F. Devlin
2014 Journal of the Royal Society Interface  
We identified a number of regulatory motifs which aggregated into coherent clusters capable of predicting the inclusion of genes within each phase module with very high fidelity and these motif combinations  ...  of circadian genes.  ...  S.P.S. carried out all computational analysis; S.P.S. and P.F.D. drafted the manuscript with help from H.Y. and A.P.; S.P.S. and PFD conceived the study; and all authors participated in the design and  ... 
doi:10.1098/rsif.2014.0535 pmid:25142519 pmcid:PMC4233729 fatcat:afkrowk4rnejhkbc2achpavoxi

Poincaré duality algebras mod two

Larry Smith, R.E. Stong
2010 Advances in Mathematics  
We then examine the isomorphism classes of 3-folds with at most three generators of degree 3, provide a complete classification, settle which such occur as the cohomology of a smooth 3-manifold, and list  ...  We study Poincaré duality algebras over the field F F F 2 of two elements.  ...  In the proof we make use of the notion of catalecticant matrices associated with a standard graded Poincaré duality algebra H .  ... 
doi:10.1016/j.aim.2010.04.013 fatcat:lhx3dakutfextpko6w5j37ldaq

On the invariant theory of finite groups: Orbit polynomials and splitting principles

Larry Smith, R.E. Stong
1987 Journal of Algebra  
We both thank the referee for a number of very useful suggestions, and for improving the exposition of Section 4.  ...  ACKNOWLEDGMENTS The first author thanks the personnel of Station 5 of the Evangelisches Krankenhaus Weende who provided a quiet atmosphere in which to start this work, and the Sonderforschungsbererch Geometrre  ...  To each element 21 E Y we associate the complex line bundle &, -1 BP'* with first Chern class zi, and to anorbit BcVofG the Gvectorbundle [B=@rEVIZCJ.BV.  ... 
doi:10.1016/0021-8693(87)90040-8 fatcat:xgz5hzojr5crpkcavs2qeq7pd4

Machine learning in the Internet of things: A semantic-enhanced approach

Michele Ruta, Floriano Scioscia, Giuseppe Loseto, Agnese Pinto, Eugenio Di Sciascio, Maria Maleshkova, Ruben Verborgh
2018 Semantic Web Journal  
Outputs of classification are endowed with computer-processable descriptions in standard Semantic Web languages, while explanation of matchmaking outcomes motivates confidence on results.  ...  Though increasingly effective, Machine Learning (ML) techniques generally do not go beyond classification of events with opaque labels, lacking machine-understandable representation and explanation of  ...  C j = ∀R.E, with R ALN role and E ALN concept formalized as E 1 · · · E p , then ∀R.E h is a concept com- The training phase is carried out on a set S of n training samples, each with at most m features  ... 
doi:10.3233/sw-180314 fatcat:ey4nc5kkarbl7l5dl6bn6kydxe

Author index to volumes 361-380

2004 Linear Algebra and its Applications  
Sgura, Gradient flow methods for matrix completion with prescribed eigenvalues 379 (2004) 85 Chu, M.T., R.E. Funderlic and R.J.  ...  Urbano, Completions of partial P-matrices with acyclic or non-acyclic associated graph 368 (2003) 25 Jung, I.B., E. Ko, C. Li and S.S.  ... 
doi:10.1016/s0024-3795(04)00021-7 fatcat:bnldcsn5nbh67occj3nwfg5hfa

Author index to volumes 301–400

2005 Linear Algebra and its Applications  
Haukkanen, Bounds for determinants of meet matrices associated with incidence functions 329 (2001) 77 Korkee, I. and P.  ...  , E., The classification of minimal matrices of size 2 Â q 340 (2002) 169 Van Barel, M., G.  ... 
doi:10.1016/s0024-3795(05)00125-4 fatcat:mrc33u36wnh57lis5jwcb7bmaa
« Previous Showing results 1 — 15 out of 436 results