Entry Chaitin:1976:ITC from tcs1975.bib
Last update: Thu Sep 27 02:46:39 MDT 2018
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
Y |
Z
BibTeX entry
@Article{Chaitin:1976:ITC,
author = "G. J. Chaitin",
title = "Information-theoretic characterizations of recursive
infinite strings",
journal = j-THEOR-COMP-SCI,
volume = "2",
number = "1",
pages = "45--48",
month = jun,
year = "1976",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Loveland's method; Meyer's theorem; recursive
functions; recursive infinite strings",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- characterization,
2(3)323,
3(1)61,
5(3)325,
8(3)325,
9(2)265
- function,
1(1)13,
1(1)21,
1(2)103,
1(2)161,
1(3)193,
1(4)289,
2(1)73,
2(2)133,
2(2)228,
2(2)249,
2(3)345,
2(3)383,
2(3)397,
3(2)225,
3(3)283,
4(1)47,
5(3)257,
5(3)325,
6(2)109,
6(3)233,
6(3)317,
7(3)325,
8(1)57,
8(2)189,
9(1)83,
9(1)127,
9(1)147,
9(2)243
- infinite,
5(2)183
- method,
1(1)1,
3(2)243,
3(3)321,
4(2)227,
4(2)235,
5(2)219,
5(3)321,
7(3)251,
7(3)311,
8(1)31,
9(1)1,
9(1)27
- Meyer,
7(1)79
- recursive,
1(2)103,
1(3)193,
2(2)133,
2(2)155,
2(3)345,
3(1)61,
3(2)225,
5(3)257,
6(2)109,
6(3)233,
6(3)255,
6(3)317,
7(1)25,
8(1)73,
8(2)177,
9(1)39,
9(1)73,
9(2)243
- string,
4(2)171
- theorem,
1(2)125,
1(3)193,
1(3)199,
1(4)317,
2(1)115,
2(2)249,
3(2)123,
3(2)225,
4(1)47,
7(1)79,
8(1)31,
8(2)255,
8(2)261,
8(3)293,
8(3)359,
8(3)393,
9(2)347