Gérard Kubryk

Bachelor in Psychology (Paris Vincennes University )

PhD in Computer science ( Nice Sophia-Antipolis University)

PhD in Education (Paris-Nanterre University) (EA 1589, APFORD team)


 Two algorithms have been developed: 


  

 k = delta(i) / i 

In this formula:

 k is the perception threshold of the stimulus variation

 i is the initial stimulus value                                                                                                                            delta(i) is the variation of the stimulus value

For example if there are 3 sweets, the brain has the following possible evaluations:

2 is too little (delta is equal to -1, above Fechner threshold)

3 delta equals 0 is included in the Fechner threshold possibilities

4 is too much (delta is equal to 1, above the Fechner threshold)

fractional values that are impossible

Conclusion: the probability of response 3 close to 1 (at the threshold of the response error) is the only one possible. This gives a fast answer and few errors.