Search results

Create the page "LarryP" on this wiki! See also the search results found.

• Division: Algorithms and user-submitted genAsm code
  I (LarryP) suspect that 128-bit division will be trickier than the shorter widths, si LarryP, 21April2015: I originally thought that doing Newton-Raphson root finding
  7 KB (1,100 words) - 04:11, 16 August 2015
• Larry's PseudoCode for Emulating Division
  LarryP's division pseudoCode, attempting to follow the Wikipedia Newton-Raphson al
  3 KB (488 words) - 03:59, 22 April 2015
• Forth for the Mill and/or Forth-like variants, better suited to the Mill
  {LarryP's opinion) /{LarryP's opinion)
  8 KB (1,266 words) - 05:21, 12 January 2016
• Preliminary Design for Mill-Forth
  {Started 04Jan2014 by LarryP} Feel free to add and/or comment, but please don't wholesale remove conten ...gn and housed within whatever we use to implement the input byte stream. /{LarryP opinion}
  7 KB (1,153 words) - 18:44, 6 January 2015
• How best to map the core components of Forth onto the Mill?
  {LarryP opinion, currently rough}: I'd generalize Ivan's statement to: <br /> /{LarryP opinion}
  8 KB (1,320 words) - 12:06, 8 January 2015