Timeline for Can you solve this problem using a finite number of queries?
Current License: CC BY-SA 4.0
14 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 8, 2020 at 18:41 | vote | accept | Erel Segal-Halevi | ||
Sep 7, 2020 at 16:55 | history | became hot network question | |||
Sep 7, 2020 at 16:22 | answer | added | Erel Segal-Halevi | timeline score: 1 | |
Sep 7, 2020 at 15:37 | comment | added | Erel Segal-Halevi | @FedorPetrov you are right, I had in mind a different question. I removed the incorrect claim. | |
Sep 7, 2020 at 15:36 | history | edited | Erel Segal-Halevi | CC BY-SA 4.0 |
deleted 39 characters in body
|
Sep 7, 2020 at 12:43 | answer | added | Iosif Pinelis | timeline score: 4 | |
Sep 7, 2020 at 12:08 | history | edited | Erel Segal-Halevi | CC BY-SA 4.0 |
added 1 character in body
|
Sep 7, 2020 at 10:08 | comment | added | Dieter Kadelka | I think that $s,t \in (0,1]$? Does $s = 0$ or $t = 0$ make any sense? | |
Sep 7, 2020 at 9:37 | comment | added | Jochen Wengenroth | For continuous $g$ I believe that a quite simple ''bisection algorithm'' does the job. | |
Sep 7, 2020 at 9:35 | comment | added | Fedor Petrov | if it is continuous, then such $x$ form an open set, how can it be a single point? | |
Sep 7, 2020 at 9:28 | comment | added | Erel Segal-Halevi | @JochenWengenroth good question. I added a continuity assumption, but not sure it matters. | |
Sep 7, 2020 at 9:27 | history | edited | Erel Segal-Halevi | CC BY-SA 4.0 |
added 11 characters in body
|
Sep 7, 2020 at 9:10 | comment | added | Jochen Wengenroth | I guess that you would not like to add continuity as an assumption? | |
Sep 7, 2020 at 8:55 | history | asked | Erel Segal-Halevi | CC BY-SA 4.0 |