It is a common observation that the intrinsic time of human experience is a highly nonlinear function of clock time. Anyone whose earliest efforts at scientific computation date back some 30 years or more must now feel separated from them by a very long span of time. The computational environment of the 1950s already belongs to a past that will be unimaginable to the generation for which the personal computer is a childhood toy. It may therefore be appropriate to start this essay with a few personal recollections typical of that era.
- Algorithmic Problem
- Algorithmic Aspect
- Markov Renewal Process
- Belgian Coast
- Personal Recollection
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Tax calculation will be finalised at checkout
Purchases are for personal use onlyLearn about institutional subscriptions
Unable to display preview. Download preview PDF.
Neuts, M. F. (1984) Matrix-analytic methods in queuing theory. European J. Operat Res. 15, 2–12.
Whittaker, E. T. and Watson, G. N. (1927) A Course of Modern Analysis. Cambridge University Press, London.
Editors and Affiliations
© 1986 Applied Probability Trust
About this chapter
Cite this chapter
Neuts, M.F. (1986). An Algorithmic Probabilist’s Apology. In: Gani, J. (eds) The Craft of Probabilistic Modelling. Applied Probability, vol 1. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8631-5_14
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-8633-9
Online ISBN: 978-1-4613-8631-5
eBook Packages: Springer Book Archive