Last update: Thu Sep 27 02:46:39 MDT 2018
@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",
}