Timeline for Category of Gödel Codings? [Reference Request]

14 events

when toggle format	what		by	license	comment
Mar 6, 2015 at 14:31	answer	added	Paul Taylor		timeline score: 8
S Mar 5, 2015 at 23:38	history	suggested	Martin Berger	CC BY-SA 3.0	Added umlaut in title
Mar 5, 2015 at 23:05	review	Suggested edits
S Mar 5, 2015 at 23:38
Mar 5, 2015 at 22:05	vote	accept	Rex Butler
Mar 5, 2015 at 20:04	answer	added	Nate Ackerman		timeline score: 9
Mar 5, 2015 at 19:12	answer	added	Andrej Bauer		timeline score: 19
Mar 5, 2015 at 18:23	history	edited	Rex Butler	CC BY-SA 3.0	edited tags
Mar 5, 2015 at 18:18	history	edited	Rex Butler		edited tags
Mar 5, 2015 at 18:16	comment	added	Rex Butler		See also: cs.nyu.edu/pipermail/fom/2005-August/009024.html
Mar 5, 2015 at 18:04	history	edited	Rex Butler	CC BY-SA 3.0	edited body
Mar 5, 2015 at 18:01	comment	added	Rex Butler		The other obvious question is whether to allow arbitrary (total) recursive functions in this definition. But, I think in the context of the Kleene Normal form theorem I think it's clear using primitive recursive functions is the correct choice. The coding/uncoding that takes place during a computation should be simple and total by construction. Unbounded minimization should be required only once, as in the Kleene Normal Form theorem.
Mar 5, 2015 at 17:56	history	edited	Rex Butler	CC BY-SA 3.0	deleted 18 characters in body
Mar 5, 2015 at 17:54	comment	added	Noah Schweber		Do you maybe want $\sim_A\subseteq A\times A$ instead of $\mathbb{N}\times\mathbb{N}$? (Also, what is the "comment below"?)
Mar 5, 2015 at 17:51	history	asked	Rex Butler	CC BY-SA 3.0