Gnomon algorithm: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| Line 1: | Line 1: | ||
The '''Gnomon algorithm''' is a [[mathematical | The '''Gnomon algorithm''' is a family of [[Mathematical function (nonfiction)|mathematical functions (nonfiction)]] which converts [[computation (nonfiction)]] to [[force (nonfiction)]]. | ||
== In the News == | == In the News == | ||
| Line 21: | Line 21: | ||
* [[Computer science (nonfiction)]] | * [[Computer science (nonfiction)]] | ||
* [[Evil bit (nonfiction)]] | * [[Evil bit (nonfiction)]] | ||
* [[Force (nonfiction)]] | |||
* [[Gnomon (nonfiction)]] | * [[Gnomon (nonfiction)]] | ||
* [[Gnomon Algorithm (nonfiction)]] | * [[Gnomon Algorithm (nonfiction)]] | ||
Revision as of 16:12, 21 August 2016
The Gnomon algorithm is a family of mathematical functions (nonfiction) which converts computation (nonfiction) to force (nonfiction).
In the News
Guo Shoujing (nonfiction) studies the Pleiades, discovers new form of Gnomon algorithm.
Binary counter working overtime, looking forward to that big paycheck.
