scholarly journals Some new computable structures of high rank

2018 ◽  
Vol 146 (7) ◽  
pp. 3097-3109 ◽  
Author(s):  
Matthew Harrison-Trainor ◽  
Gregory Igusa ◽  
Julia F. Knight
2007 ◽  
Vol 72 (4) ◽  
pp. 1418-1432 ◽  
Author(s):  
W. Calvert ◽  
E. Fokina ◽  
S. S. Goncharov ◽  
J. F. Knight ◽  
O. Kudinov ◽  
...  

AbstractThis paper calculates, in a precise way. the complexity of the index sets for three classes of computable structures: the class of structures of Scott rank , the class , of structures of Scott rank , and the class K of all structures of non-computable Scott rank. We show that I(K) is m-complete is m-complete relative to Kleene's and is m-complete relative to .


2015 ◽  
pp. 5-24 ◽  
Author(s):  
V. Avtonomov

The article asks which human qualities can serve as the base for a liberal economic policy. The author is looking for an answer to this question in the classical works of economic liberalism - in the books by F. Bastiat, L. von Mises, F. von Hayek, W. Eucken, and M. Friedman. The two main qualities can be summarized as follows: the relatively high rank of freedom among human values and rational utilitarian calculus. It is assumed that in those countries where the both human prerequisites are present the liberal policy (for instance, liberal reforms) can be self-supportive and may have good results. On the contrary, if the first prerequisite is missing and a liberal policy can be based only on rational calculus, the “paternalistic” liberalism prevails and chances for success are much smaller.


2019 ◽  
Vol 46 (3) ◽  
pp. 642-650 ◽  
Author(s):  
Xuefeng SU ◽  
Yan LIU ◽  
Zhouqi CUI ◽  
Jianguo ZHANG ◽  
Li YU ◽  
...  

2007 ◽  
Vol 72 (3) ◽  
pp. 1003-1018 ◽  
Author(s):  
John Chisholm ◽  
Jennifer Chubb ◽  
Valentina S. Harizanov ◽  
Denis R. Hirschfeldt ◽  
Carl G. Jockusch ◽  
...  

AbstractWe study the weak truth-table and truth-table degrees of the images of subsets of computable structures under isomorphisms between computable structures. In particular, we show that there is a low c.e. set that is not weak truth-table reducible to any initial segment of any scattered computable linear ordering. Countable subsets of 2ω and Kolmogorov complexity play a major role in the proof.


1998 ◽  
Vol 22 (2) ◽  
pp. 260-273 ◽  
Author(s):  
Aviad Heifetz ◽  
Dov Samet
Keyword(s):  

2003 ◽  
Vol 90 (25) ◽  
Author(s):  
V. V. Yashchuk ◽  
D. Budker ◽  
W. Gawlik ◽  
D. F. Kimball ◽  
Yu. P. Malakyan ◽  
...  

PLoS ONE ◽  
2018 ◽  
Vol 13 (2) ◽  
pp. e0192481 ◽  
Author(s):  
Kezia R. Manlove ◽  
Rebecca M. Belou
Keyword(s):  

2014 ◽  
Vol 596 ◽  
pp. 292-296
Author(s):  
Xin Li Li

PageRank algorithms only consider hyperlink information, without other page information such as page hits frequency, page update time and web page category. Therefore, the algorithms rank a lot of advertising pages and old pages pretty high and can’t meet the users' needs. This paper further studies the page meta-information such as category, page hits frequency and page update time. The Web page with high hits frequency and with smaller age should get a high rank, while the above two factors are more or less dependent on page category. Experimental results show that the algorithm has good results.


Sign in / Sign up

Export Citation Format

Share Document