Timeline for The definition of computational complexity or complexity measure of computing reals [closed]

11 events

when toggle format	what		by	license	comment
Nov 3, 2014 at 8:01	vote	accept	XL _At_Here_There
Nov 1, 2014 at 22:15	history	edited	Bjørn Kjos-Hanssen	CC BY-SA 3.0	added 5 characters in body
Oct 31, 2014 at 1:09	review	Reopen votes
Oct 31, 2014 at 8:43
Oct 31, 2014 at 0:50	history	edited	XL _At_Here_There	CC BY-SA 3.0	deleted 2 characters in body
Oct 30, 2014 at 22:20	history	closed	Andrés E. Caicedo Qiaochu Yuan Stefan Kohl♦ Emil Jeřábek John Pardon		Needs details or clarity
Oct 30, 2014 at 15:29	comment	added	Timothy Chow		I did not interpret XL's definition differently from Minsky's definition. Note that Wikipedia correctly goes on to say that this is not the definition that is most commonly used today.
Oct 30, 2014 at 9:44	comment	added	Mirko		According to your definition it sounds like different Turing machines could be picked for different $i$, and then every real would be "computable". The above link to wikipedia says: "A computable number [is] one for which there is a Turing machine which, given n on its initial tape, terminates with the n-th digit of that number [encoded on its tape]." So the same Turing machine should work for that $r$, and given $i$ that Turing machine would tell you the first $i$ digits.
Oct 30, 2014 at 8:23	answer	added	Bjørn Kjos-Hanssen		timeline score: 3
Oct 30, 2014 at 7:02	review	Close votes
Oct 30, 2014 at 22:20
Oct 30, 2014 at 6:57	comment	added	Victor		en.wikipedia.org/wiki/Computable_number
Oct 30, 2014 at 6:20	history	asked	XL _At_Here_There	CC BY-SA 3.0