Class information for:
Level 1: ALGORITHMIC RANDOMNESS//TURING DEGREES//KOLMOGOROV COMPLEXITY

Basic class information
Class id #P Avg. number of
references		 Database coverage
of references
8238 1276 19.6 30%


Bar chart of Publication_year

Last years might be incomplete

Hierarchy of classes
The table includes all classes above and classes immediately below the current class.


Cluster id Level Cluster label #P
9 4 COMPUTER SCIENCE, THEORY & METHODS//COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE//COMPUTER SCIENCE, INFORMATION SYSTEMS 1247339
621 3       MEMBRANE COMPUTING//THEORETICAL COMPUTER SCIENCE//LOGIC 13680
2585 2             LOGIC//JOURNAL OF SYMBOLIC LOGIC//ANNALS OF PURE AND APPLIED LOGIC 3649
8238 1                   ALGORITHMIC RANDOMNESS//TURING DEGREES//KOLMOGOROV COMPLEXITY 1276

Terms with highest relevance score


rank Term termType Chi square Shr. of publ. in
class containing
term		 Class's shr. of
term's tot. occurrences		 #P with
term in
class
1 ALGORITHMIC RANDOMNESS authKW 1195250 5% 78% 64
2 TURING DEGREES authKW 790740 4% 62% 53
3 KOLMOGOROV COMPLEXITY authKW 642803 8% 28% 96
4 LOGIC WoSSC 596165 47% 4% 605
5 COMPUTABLY ENUMERABLE SET authKW 528601 2% 82% 27
6 COMPUTABLY ENUMERABLE authKW 408049 1% 95% 18
7 MARTIN LOF RANDOMNESS authKW 405863 2% 81% 21
8 JOURNAL OF SYMBOLIC LOGIC journal 389086 17% 8% 217
9 PI01 CLASSES authKW 369184 1% 86% 18
10 ENUMERATION DEGREES authKW 359923 1% 79% 19

Web of Science journal categories


Rank Term Chi square Shr. of publ. in
class containing
term		 Class's shr. of
term's tot. occurrences		 #P with
term in
class
1 Logic 596165 47% 4% 605
2 Mathematics 34124 70% 0% 892
3 Computer Science, Theory & Methods 10494 25% 0% 322
4 Mathematics, Applied 4536 24% 0% 311
5 Philosophy 233 2% 0% 30
6 Computer Science, Hardware & Architecture 65 2% 0% 20
7 Computer Science, Information Systems 62 2% 0% 31
8 Computer Science, Software Engineering 36 2% 0% 22
9 Statistics & Probability 8 1% 0% 15
10 Humanities, Multidisciplinary 6 0% 0% 5

Address terms


Rank Term Chi square Shr. of publ. in
class containing
term		 Class's shr. of
term's tot. occurrences		 #P with
term in
class
1 MATH COMP SCI R MAGARI 95716 0% 100% 4
2 MATH STAT OPERAT 58030 2% 9% 28
3 ARBEITSGRP MATH LOGIK THEORET INFORMAT 23929 0% 100% 1
4 ECC 139 23929 0% 100% 1
5 KANAYAMA STUDY 23929 0% 100% 1
6 LOG ALGORITHMS THEORY 23929 0% 100% 1
7 MATH NATURWISS FAK 2 23929 0% 100% 1
8 OFF 592 23929 0% 100% 1
9 PHILOSOPHY LOG 23929 0% 100% 1
10 REGENT COURT KROTO 23929 0% 100% 1

Journals


Rank Term Chi square Shr. of publ. in
class containing
term		 Class's shr. of
term's tot. occurrences		 #P with
term in
class
1 JOURNAL OF SYMBOLIC LOGIC 389086 17% 8% 217
2 ANNALS OF PURE AND APPLIED LOGIC 261208 12% 7% 150
3 ARCHIVE FOR MATHEMATICAL LOGIC 143533 6% 8% 76
4 MATHEMATICAL LOGIC QUARTERLY 66058 4% 5% 57
5 ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK 40600 2% 6% 29
6 NOTRE DAME JOURNAL OF FORMAL LOGIC 40521 2% 8% 20
7 BULLETIN OF SYMBOLIC LOGIC 34108 1% 8% 19
8 THEORY OF COMPUTING SYSTEMS 29542 3% 4% 35
9 JOURNAL OF MATHEMATICAL LOGIC 25170 1% 11% 10
10 JOURNAL OF LOGIC AND COMPUTATION 18195 2% 3% 27

Author Key Words


Rank Term Chi square Shr. of publ. in
class containing
term		 Class's shr. of
term's tot. occurrences		 #P with
term in
class		 LCSH search Wikipedia search
1 ALGORITHMIC RANDOMNESS 1195250 5% 78% 64 Search ALGORITHMIC+RANDOMNESS Search ALGORITHMIC+RANDOMNESS
2 TURING DEGREES 790740 4% 62% 53 Search TURING+DEGREES Search TURING+DEGREES
3 KOLMOGOROV COMPLEXITY 642803 8% 28% 96 Search KOLMOGOROV+COMPLEXITY Search KOLMOGOROV+COMPLEXITY
4 COMPUTABLY ENUMERABLE SET 528601 2% 82% 27 Search COMPUTABLY+ENUMERABLE+SET Search COMPUTABLY+ENUMERABLE+SET
5 COMPUTABLY ENUMERABLE 408049 1% 95% 18 Search COMPUTABLY+ENUMERABLE Search COMPUTABLY+ENUMERABLE
6 MARTIN LOF RANDOMNESS 405863 2% 81% 21 Search MARTIN+LOF+RANDOMNESS Search MARTIN+LOF+RANDOMNESS
7 PI01 CLASSES 369184 1% 86% 18 Search PI01+CLASSES Search PI01+CLASSES
8 ENUMERATION DEGREES 359923 1% 79% 19 Search ENUMERATION+DEGREES Search ENUMERATION+DEGREES
9 COMPUTABLY ENUMERABLE DEGREES 336498 1% 94% 15 Search COMPUTABLY+ENUMERABLE+DEGREES Search COMPUTABLY+ENUMERABLE+DEGREES
10 ENUMERATION REDUCIBILITY 316702 1% 88% 15 Search ENUMERATION+REDUCIBILITY Search ENUMERATION+REDUCIBILITY

Core articles
The table includes core articles in the class. The following variables is taken into account for the relevance score of an article in a cluster c:
(1) Number of references referring to publications in the class.
(2) Share of total number of active references referring to publications in the class.
(3) Age of the article. New articles get higher score than old articles.
(4) Citation rate, normalized to year.


Rank Reference # ref.
in cl.		 Shr. of ref. in
cl.		 Citations
1 BARMPALIAS, G , (2013) ALGORITHMIC RANDOMNESS AND MEASURES OF COMPLEXITY.BULLETIN OF SYMBOLIC LOGIC. VOL. 19. ISSUE 3. P. 318-350 43 98% 0
2 DOWNEY, R , HIRSCHFELDT, DR , NIES, A , TERWIJN, SA , (2006) CALIBRATING RANDOMNESS.BULLETIN OF SYMBOLIC LOGIC. VOL. 12. ISSUE 3. P. 411 -491 48 87% 35
3 GREENBERG, N , KUCERA, A , NIES, A , BIENVENU, L , TURETSKY, D , (2016) COHERENT RANDOMNESS TESTS AND COMPUTING THE K-TRIVIAL SETS.JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY. VOL. 18. ISSUE 4. P. 773 -812 30 100% 2
4 KIHARA, T , MIYABE, K , (2015) UNIFIED CHARACTERIZATIONS OF LOWNESS PROPERTIES VIA KOLMOGOROV COMPLEXITY.ARCHIVE FOR MATHEMATICAL LOGIC. VOL. 54. ISSUE 3-4. P. 329 -358 31 94% 0
5 SHORE, RA , (2006) DEGREE STRUCTURES: LOCAL AND GLOBAL INVESTIGATIONS.BULLETIN OF SYMBOLIC LOGIC. VOL. 12. ISSUE 3. P. 369 -389 34 100% 5
6 BARMPALIAS, G , LI, AS , (2013) KOLMOGOROV COMPLEXITY AND COMPUTABLY ENUMERABLE SETS.ANNALS OF PURE AND APPLIED LOGIC. VOL. 164. ISSUE 12. P. 1187 -1200 25 100% 0
7 DOWNEY, R , STOB, M , (1993) SPLITTING THEOREMS IN RECURSION-THEORY.ANNALS OF PURE AND APPLIED LOGIC. VOL. 65. ISSUE 1. P. 1-106 42 98% 13
8 BARMPALIAS, G , DAY, AR , LEWIS-PYE, AEM , (2014) THE TYPICAL TURING DEGREE.PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY. VOL. 109. ISSUE . P. 1 -39 21 95% 1
9 RUTE, J , (2016) COMPUTABLE RANDOMNESS AND BETTING FOR COMPUTABLE PROBABILITY SPACES.MATHEMATICAL LOGIC QUARTERLY. VOL. 62. ISSUE 4-5. P. 335 -366 24 77% 0
10 GREENBERG, N , HIRSCHFELDT, DR , NIES, A , (2012) CHARACTERIZING THE STRONGLY JUMP-TRACEABLE SETS VIA RANDOMNESS.ADVANCES IN MATHEMATICS. VOL. 231. ISSUE 3-4. P. 2252 -2293 20 100% 1

Classes with closest relation at Level 1


Rank Class id link
1 20473 COMPUTABLE STRUCTURE//COMPUTABLE CATEGORICITY//COMPUTABLE MODEL
2 16666 COMPUTABLE ANALYSIS//COMPUTABLE TOPOLOGY//COMPUTABLE METRIC SPACE
3 13423 REVERSE MATHEMATICS//LOGIC//FUNCTIONAL INTERPRETATION
4 33651 NORMAL NUMBERS//CANTOR SERIES//POLYNOMIAL TIME RANDOMNESS
5 3519 RESOURCE BOUNDED MEASURE//POLYNOMIAL TIME HIERARCHY//COMPLEXITY CLASSES
6 32030 NORMALIZED COMPRESSION DISTANCE//WORD REMOVAL//INFORMATION DISTANCE
7 37103 PARTIAL ENUMERATED SET//ACCEPTABLE NUMERATION//CONSTRUCTIVE FUNCTOR
8 31410 SERV LOG//GPK THEORY//ANTI FOUNDATION
9 19493 EPSILON MACHINE//PROBABILISTIC FINITE STATE AUTOMATA//SYMBOLIC TIME SERIES ANALYSIS
10 17404 HYPERCOMPUTATION//CHURCH TURING THESIS//ANALOG COMPUTATION

Go to start page