Talk:Geometric algebra: Difference between revisions
Content added Content deleted
No edit summary |
No edit summary |
||
| Line 14: | Line 14: | ||
::::There is no way to verify this kind of things from just the output. We have to trust the code to do something significant without cheating. What I suggested in the task description was to pick a random vector and check that its square is a Real.--[[User:Grondilu|Grondilu]] ([[User talk:Grondilu|talk]]) 16:28, 14 October 2015 (UTC) |
::::There is no way to verify this kind of things from just the output. We have to trust the code to do something significant without cheating. What I suggested in the task description was to pick a random vector and check that its square is a Real.--[[User:Grondilu|Grondilu]] ([[User talk:Grondilu|talk]]) 16:28, 14 October 2015 (UTC) |
||
::::: Ok, so I think what you are saying is roughly that the task should instead be implementing <math>\begin{array}{c}\exists \mathbf{x}\in\mathcal{V},\,\mathbf{x}^2\in\R |
|||
\end{array}</math> with the added constraint that <math>{x}</math> must be picked arbitrarily from the space? That's certainly doable... --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 16:34, 14 October 2015 (UTC) |
|||