Timeline for Are finite presentations of arithmetic groups computable?
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 28, 2018 at 21:38 | history | edited | YCor |
edited tags
|
|
| Sep 28, 2018 at 19:25 | comment | added | NWMT | @Ycor, yes you're right. I fixed that. | |
| Sep 28, 2018 at 19:24 | history | edited | NWMT | CC BY-SA 4.0 |
Adressed a comment.
|
| Sep 28, 2018 at 16:06 | answer | added | Igor Rivin | timeline score: 5 | |
| Sep 28, 2018 at 14:46 | comment | added | Benjamin Steinberg | I haven't looked at the paper in years. My belief is everything in the paper is effective but I don't remember if they looked specifically at computing a presentation. | |
| Sep 28, 2018 at 12:57 | comment | added | NWMT | Actually I just had a look at the Grunewald-Segal paper in Annals, I quote: "Algorithm B does no more than laboriously make each step of their [Borel & Harish-Chandra] constructive." However, the output of Algorithm B s just a set of generating matrices for the arithmetic group $\Gamma$. | |
| Sep 28, 2018 at 11:30 | comment | added | Benjamin Steinberg | That's what I believe but there are bigger experts than me. | |
| Sep 28, 2018 at 11:19 | comment | added | NWMT | Hi! Thanks for that! At the moment I'm only interested in theoretical computability. So what you're saying is that the proof is constructive and one could conceivably go through each step and there are no anticipated obstacles to computability. | |
| Sep 28, 2018 at 1:24 | comment | added | Benjamin Steinberg | I believe their proof "computes" a presentation but there is no primitive recursive bound in how long their algorithm takes. | |
| Sep 28, 2018 at 0:19 | history | asked | NWMT | CC BY-SA 4.0 |