“School of Particles And Accelerator”
Back to Papers HomeBack to Papers of School of Particles And Accelerator
| Paper IPM / Particles And Accelerator / 17037 |
|
||||||
| Abstract: | |||||||
|
Motivated by studies of ultimate speed of computers, we examine the question of minimum time of orthogonalization in a simple anharmonic oscillator and find an upper bound on the rate of computations. Furthermore, we investigate the growth rate of complexity of operation when the system undergoes a definite perturbation. At the phase space of the parameters, by numerical analysis, we find the critical point where beyond that the rate of complexity changes its behavior.
Download TeX format |
|||||||
| back to top | |||||||
