Talk:Angel problem
From Wikipedia, the free encyclopedia
Contents |
[edit] Defn of distance
Is the power measured as Pythagorean or New York distance? Or some other metric? -- The Anome 10:55, 17 Oct 2004 (UTC)
New York distance. It doesn't matter though for the purposes of the angel problem. Barnaby dawson 14:26, 17 Oct 2004 (UTC)
See Conway's 1996 paper. Rich Farmbrough, 15:41 12 October 2006 (GMT).
[edit] Lower bound for C in 3D case?
Is there a known lower bound for the angel's power C in the three-dimensional case so that the angel has a winning strategy? I.e., is a number c known such that a winning strategy exists for all C >= c? -- Schnee 00:04, 25 Oct 2004 (UTC)
My seminar notes say that it works in general (The qualifier 'For high enough powered' is not necessary). I put it in to start with as I didn't have the notes to hand. Also adding further proved result. Barnaby dawson 14:27, 31 Oct 2004 (UTC)
13 is such a lower bound (details). Smaller values should not be too hard to obtain, at the cost of more involved arguments. -- AgentM 11:45, 5 Nov 2004 (UTC)
- Cool, thanks. I'll check out that dissertation. ^^ -- Schnee 18:28, 5 Nov 2004 (UTC)
Further to discussion with Imre leader the proof is not known to generalise to C lower than 13. The link given above shows that the proof works for 13 and above. I've corrected the text. Barnaby dawson 23:02, 5 Nov 2004 (UTC) (I don't normally edit on weekdays but I felt I should correct my own error).
[edit] Multi-dimensional angels
Shouldn't Tom Körner be credited for the proof? Gdr 19:41, 2004 Nov 7 (UTC)
As I understand Tom Körner showed that for high enough dimension the angel can escape but not for 3 dimensions. Imre Leader gave a seminar about his proof which Tom Körner knew about (They are in the same department). But Tom did not ask for credit. So probably not. This other guy who published the paper linked to above should probably be mentioned though. I'll do that. Barnaby dawson 21:39, 7 Nov 2004 (UTC)
So doesn't Körner deserve credit for the "high enough dimension" step? Gdr 00:23, 2004 Nov 8 (UTC)
[edit] The Natural Topology on the Set of all Plays
Hello, the above was referred to in the article. Which topology is that? --AlephNull 16:08, 25 November 2005 (UTC)
Further, in the same paragraph, it would help simply to define the word play. I just found myself writing paragraphs of speculation... Fun but eventually annoying... Orthografer 23:42, 15 August 2006 (UTC)
I've been told following standard teminology: a game is a set of rules, as chess and go are games. A play is the result of actually playing the game once. A move is an action of one player in a game, like e4, a move that in chess notation means "move pawn to the square e4." In a game that allows infinitely many moves, we normalize by making illegal moves possible (automatically giving a win to the other side) and padding each play that has finitely many moves by adding infinitely many irrelevant moves that don't change the outcome of the play. Thus any move is possible regardless of circumstance within the play, and all games are infinite. It is a fact that this normalized set P of plays is the product of a countable sequence of copies of the set M of moves. We give M the discrete topology and P the product topology. Orthografer 19:21, 25 August 2006 (UTC)
[edit] Style
Hi Barnaby I made the edit, because I thought it would be clearer to a lay person who would have no idea what "the angel has power k" means. They might think it means something like in a role playing game. So, I think it's more than style, it's about a better understanding for the reader. Hope you can live with my edit. Mccready 01:49, 30 April 2006 (UTC)
[edit] Resolved?
A paper from Prof. Bowditch of the University of Southampton, claiming a winning strategy for the 4-Angel:
http://www.maths.soton.ac.uk/staff/Bowditch/papers/bhb-angel.pdf Nchua 01:00, 9 September 2006 (UTC)
I shall have a look at this paper today and change the article if appropriate. Barnaby dawson 08:42, 9 September 2006 (UTC)
- It's still a preprint, from what I can tell. I doubt you will find an error so readily, and in any case WP:NOR means reviewing this paper is pointless. It's definitely worth mentioning, given that Bowditch is a highly respected mathematician, so his claim of a proof is notable. Bowditch's abstract also mentions that Kloster has a proof for the 2-angel, but I can't find a written proof using Google. --Chan-Ho (Talk) 11:41, 9 September 2006 (UTC)
-
- Almost half way through the paper. Is really quite interesting. I'm not going to claim just because I've read it and failed to find an error that its valid. But I might put up an outline of his approach once I've read it. Hence reading it is worthwile (even just for wikipedia's sake).
-
- Also I don't recall WP:NOR stating that you couldn't assess the reliability of a source. I think that's kind of crucial. At the very least with a mathematical breakthrough that must mean reading through the proof (where you can understand it). You'd be right of course that that isn't enough to conclude a source is reliable. Barnaby dawson 16:37, 9 September 2006 (UTC)
-
- I've finished reading the paper. It's a lovely argument and quite accessible. It requires a tiny bit of knowledge in graph theory but is almost all from first principles otherwise. I'm betting this proof is correct. I will now add a section with some notes on the claimed proof. Barnaby dawson 13:32, 12 September 2006 (UTC)
[edit] Verified
I have removed the not verified message. The anonomous editor who added it did not specify what information in the section was not verifiable. For the record all the results in there (apart from the recent proof claims) come from the notes I took at a seminar on the angel problem (including a solution for the 3D case) given by Imre Leader. I have seen proofs of all of them bar the last. We might not be able to find these proofs in print. Barnaby dawson 08:01, 30 September 2006 (UTC)
[edit] Avoiding interference with the academic process
I have removed a sentence saying that two of the claimed proofs have been accepted in a peer reviewed journal on the suggestion of the author of one of them. He felt that this was not normally general knoledge and that it might seem to give priority to those solutions. Barnaby dawson 13:08, 2 October 2006 (UTC)
