Skip to main content

Timeline for Find a Fixed Point

Current License: CC BY-SA 4.0

44 events
when toggle format what by license comment
Jan 10, 2023 at 19:28 answer added bigyihsuan timeline score: 0
Dec 12, 2022 at 16:17 answer added Shaggy timeline score: 0
Nov 22, 2022 at 21:38 answer added Kamil Drakari timeline score: 0
Nov 22, 2022 at 16:55 answer added Jordan timeline score: 0
Aug 10, 2022 at 22:05 answer added Conor O'Brien timeline score: 1
Aug 10, 2022 at 21:22 answer added naffetS timeline score: 0
Aug 10, 2022 at 20:53 answer added Benji timeline score: 1
Sep 17, 2020 at 0:21 history edited caird coinheringaahin g CC BY-SA 4.0
deleted 147 characters in body
Jan 7, 2018 at 21:53 history tweeted twitter.com/StackCodeGolf/status/950123319931670528
Dec 14, 2017 at 11:15 comment added flawr Yes, you can assume that the numbers required to compute the sequence are all in a reasonable range.
Dec 14, 2017 at 7:05 comment added user202729 What if the program just repeatedly apply <the number of values in the native integer data type> times the function f on x_0? Is that abuse of native integer data type?
Dec 14, 2017 at 6:29 answer added l4m2 timeline score: 1
Dec 12, 2017 at 2:44 answer added Jakob timeline score: 1
Dec 11, 2017 at 12:56 answer added Nahuel Fouilleul timeline score: 0
Dec 11, 2017 at 10:36 comment added flawr @RosLuP Your program just has to work if there is such a fixed point (see second bullet point in the details)
Dec 11, 2017 at 8:33 comment added user58988 And if not exist a fixed point, for a function f, and one initial value x0... What should be the value it have to return? And if x0=0 and f=int(9/(x-1)) with for x1=x0+1 f(x1)=f(1) is already one error... What should return the operator for that f , x0?
Dec 10, 2017 at 11:55 answer added user58988 timeline score: 1
Dec 10, 2017 at 8:18 answer added DLosc timeline score: 1
Dec 9, 2017 at 16:25 answer added NikoNyrh timeline score: 1
Dec 9, 2017 at 9:52 answer added Laikoni timeline score: 7
Dec 9, 2017 at 6:05 answer added user202729 timeline score: 4
Dec 9, 2017 at 4:46 comment added user202729 Note for future visitors: Finding any fixed point doesn't work, you must find a fixed point reachable from x_0. It's guaranteed that there exists one.
Dec 9, 2017 at 4:44 comment added user202729 Oh, originally I thought that the submission is not given x_0, which caused me some confusion. I thought a solution should be (Jelly) ~Nƭ⁻Ç$¿, which is something like, (pseudo code) for x in [0, -1, 1, -2, 2, -3, 3, -4, 4, ...]: if (x == f(x)): break; print(x); . That may worth another challenge.
Dec 9, 2017 at 3:27 answer added Reinstate Monica -- notmaynard timeline score: 1
Dec 9, 2017 at 2:41 answer added Οurous timeline score: 2
Dec 9, 2017 at 2:23 answer added Conor O'Brien timeline score: 2
Dec 8, 2017 at 22:55 answer added mbomb007 timeline score: 1
Dec 8, 2017 at 21:18 answer added nimi timeline score: 11
Dec 8, 2017 at 20:09 comment added flawr @phflack The blackbox only has to converge for the given input.
Dec 8, 2017 at 20:03 comment added phflack Note that while it's implied in the details that the black box function will converge on the fixed point, the last example says otherwise
Dec 8, 2017 at 19:47 answer added ovs timeline score: 1
Dec 8, 2017 at 19:30 answer added Endenite timeline score: 3
Dec 8, 2017 at 19:27 answer added H.PWiz timeline score: 13
Dec 8, 2017 at 19:26 answer added ovs timeline score: 5
Dec 8, 2017 at 19:25 answer added J. Sallé timeline score: 2
Dec 8, 2017 at 19:24 history edited flawr CC BY-SA 3.0
added 8 characters in body
Dec 8, 2017 at 19:01 answer added Giuseppe timeline score: 7
Dec 8, 2017 at 18:59 answer added caird coinheringaahin g timeline score: 4
Dec 8, 2017 at 18:59 answer added Giuseppe timeline score: 1
Dec 8, 2017 at 18:57 answer added user45941 timeline score: 17
Dec 8, 2017 at 18:55 answer added ovs timeline score: 5
Dec 8, 2017 at 18:52 answer added flawr timeline score: 10
Dec 8, 2017 at 18:46 answer added ZaMoC timeline score: 7
Dec 8, 2017 at 18:37 history asked flawr CC BY-SA 3.0