Start to do some experiments with Microdown.

Author: SergeStinckwich

src/Math-Core-Process/PMFixpoint.class.st

@@ -1,10 +1,13 @@
 "
-A Fixpoint is just a little utility. it calculates the fixpoint of a block with one variable. a starting value for the variable is necessary. the variable does not need to be numerical, it can be anything the block can eat and spit out.
-example:
-a:=Fixpoint block: [:x| 1/ (1+x )] value: 20.0.
-a evaluate. 
-""-->0.6180339887498948""
+`PMFixpoint` is just a little utility. It calculates the fixpoint of a block with one variable. A starting value for the variable is necessary. The variable does not need to be numerical, it can be anything the block can eat and spit out.
 
+Example:
+
+```
+| a |
+a := PMFixpoint block: [:x| 1/(1+x)] value: 20.0.
+a evaluate
+```
 "
 Class {
 	#name : #PMFixpoint,
@@ -18,7 +21,7 @@ Class {
 		'verbose',
 		'equalityTest'
 	],
-	#category : 'Math-Core-Process'
+	#category : #'Math-Core-Process'
 }
 
 { #category : #'instance-creation' }

src/Math-Core-Process/PMIterativeProcess.class.st

@@ -1,14 +1,14 @@
 "
-A PMIterativeProcess class is an abstract base class for processes which follow an iterative pattern. 
+A `PMIterativeProcess` class is an abstract base class for processes which follow an iterative pattern. 
 
-Subclasses of PMIterativeProcess will redefine
-	initializeIterations
-	evaluateIteration
-	finalizeIterations
+Subclasses of `PMIterativeProcess` will redefine:
+- `initializeIterations`
+- `evaluateIteration`
+- `finalizeIterations`
 
-The instance variable result is used to store the most recent/best result, and is accessible through the result selector.
+The instance variable `result` is used to store the most recent/best result, and is accessible through the result selector.
 
-The maximumIterations: method allows control of the amount of work this method is allowed to do. Each evaluation of the iteration increments the instance variable iterations. When this number exceeds maximumIterations, the evaluate method will stop the process, and answer result.
+The maximumIterations: method allows control of the amount of work this method is allowed to do. Each evaluation of the iteration increments the instance variable `iterations`. When this number exceeds `maximumIterations,` the evaluate method will stop the process, and answer `result`.
 
 "
 Class {
@@ -21,7 +21,7 @@ Class {
 		'result',
 		'iterations'
 	],
-	#category : 'Math-Core-Process'
+	#category : #'Math-Core-Process'
 }
 
 { #category : #default }

src/Math-Core/PMFloatingPointMachine.class.st

@@ -1,28 +1,16 @@
 "
-A PMFloatingPointMachine represents the numerical precision of this system.
-
-Instance Variables
-
-	defaultNumericalPrecision:		The relative 
-numerical precision that can be expected for a general numerical computation. One should consider to numbers a and b equal if the relative difference between them is less than the default machine precision.
-
-	largestExponentArgument:		natural logarithm of largest number
-
-	largestNumber:		The largest positive number that can be represented in the machine
-
-	machinePrecision:		r^{-(n+1)}, with the largest n such that (1 + r^-n) - 1 != 0
-
-	negativeMachinePrecision:		r^{-(n+1)}, with the largest n such that (1 - r^-n) - 1 != 0
-
-	radix:		The radix of the floating point representation. This is often 2.
-
-	smallNumber:		A number that can be added to some value without noticeably changing the result of the computation
-
-	smallestNumber:		The smallest positive number different from 0.
-
-
-largestExponentArgument
-	- xxxxx
+A `PMFloatingPointMachine` represents the numerical precision of this system.
+
+##Instance Variables
+
+- `defaultNumericalPrecision`	The relative numerical precision that can be expected for a general numerical computation. One should consider to numbers a and b equal if the relative difference between them is less than the default machine precision,
+- `largestExponentArgument` Natural logarithm of largest number,
+- `largestNumber` The largest positive number that can be represented in the machine,
+- `machinePrecision` $r^{-(n+1)}$, with the largest n such that $(1 + r^{-n}) - 1$ != 0,
+- `negativeMachinePrecision` $r^{-(n+1)}$, with the largest n such that $(1 - r^{-n}) - 1$ != 0,
+- `radix` The radix of the floating point representation. This is often 2,
+- `smallNumber` A number that can be added to some value without noticeably changing the result of the computation,
+- `smallestNumber` The smallest positive number different from 0.
 
 This class is detailed in Object Oriented Implementation of Numerical Methods, Section 1.4.1 and 1.4.2.