Search all the public and authenticated articles in CiteULike.
Enter a search phrase. You can also specify

a CiteULike article id (123456),

a DOI (doi:10.1234/12345678)

or a PubMed Id (pmid:12345678).

Click Help for advanced usage.

ChaTo's Chaitin:G [10 articles] Export

Recent papers posted to ChaTo's library by the author Chaitin:G. You can also see everyone's Chaitin:G.

	A New Version of Algorithmic Information Theory [My Copy] (April 1995) by Gregory J. Chaitin posted to math phylosophy by ChaTo on 2005-09-22 14:18:19 as
	Leibniz, Information, Math and Physics [My Copy] (21 Jun 2003) by G. J. Chaitin posted to math phylosophy by ChaTo on 2005-09-22 14:16:39 as
	How real are real numbers? [My Copy] (24 November 2004) by G. J. Chaitin posted to math phylosophy by ChaTo on 2005-09-22 14:10:39 as along with 13 people and 2 groups qwermish sourada mafwood A_Olympia DineshGaitonde jrw xtizon proportional BrendaChng scis0000001 jimburton SamB watson Philosophy_of_Information Blog_and_Wiki_Research
	Randomness in Arithmetics [My Copy] Scientific American, Vol. 259, No. 1. (July 1988), pp. 80-85. by Gregory J. Chaitin posted to math phylosophy by ChaTo on 2005-09-22 14:01:42 as
	Randomness and Mathematical Proof [My Copy] Scientific American, Vol. 232, No. 5. (May 1975), pp. 47-52. by Gregory J. Chaitin posted to math phylosophy by ChaTo on 2005-09-22 14:00:47 as
	Meta Math! : The Quest for Omega [My Copy] (04 October 2005) by Gregory Chaitin posted to math phylosophy by ChaTo on 2005-09-15 17:50:18 as
	Paradoxes of Randomness [My Copy] ArXiv Mathematics e-prints (August 2001) by G. J. Chaitin posted to math phylosophy by ChaTo on 2005-09-15 17:46:53 as
	Two philosophical applications of algorithmic information theory [My Copy] (27 Feb 2003) by G. J. Chaitin posted to math phylosophy by ChaTo on 2005-09-15 17:45:34 as along with 1 person jrw
	Irreducible Complexity in Pure Mathematics [My Copy] (4 Nov 2004) by G. J. Chaitin posted to math phylosophy by ChaTo on 2005-09-15 17:44:44 as along with 2 people and 1 group jrw rahul SRL
	On the intelligibility of the universe and the notions of simplicity, complexity and irreducibility [My Copy] (2 Oct 2002) by G. J. Chaitin posted to math phylosophy by ChaTo on 2005-09-15 17:43:38 as along with 1 person jrw

Note: You may cite this page as: http://www.citeulike.org/user/ChaTo/author/Chaitin:G

CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.

web-graph	198
ranking	187
characterization	132
search	116
adversarial-ir	110
clicks	104
social	93
queries	90
graph	85
crawling	78
time	75
text	64
clustering	54
similarity	52
technology	40
math	36
classification	34
machine-learning	32
sequence	22
blogs	20
wikipedia	20
hci	19
reputation	18
trust	17
phylosophy	16
design	15
visualization	15
tagging	14
p2p	13
stream	12
advertising	11
economy	10
answers	10
xml	10
news	7
language	7
caching	6
peer-production	6
databases	5
algorithms	5
email	5
context	5
semantic-web	5
link-prediction	5
corpus	5
compression	4
collaboration	4
cloaking	4
image	3
indexing	3
geo	3
voting	3
sampling	3
physics	2
accesibility	2
summarization	1
security	1
game-theory	1
biology	1

ChaTo's Chaitin:G [10 articles] Export

ChaTo's tags