Contact us Heritage collections Image license terms
HOME ACL Associates Technology Literature Applications Society Software revisited
Further reading □ Overview □ 1-4 System □ 5-11 Matrix □ 12-20 System □ 22-28 I/O □ 29-31 Translators □ 37-48 System □ 50-59 Linear algebra □ 60-69 Eigen □ Equations □ 70-74 Algebraic □ 75-79 Differential □ 80-84 Quadrature □ 85-95 Approx □ 96-99 Probability □ 100-105 Numerische Mathematik □ 106-110 Graphing
ACD C&A INF CCD CISD Archives Contact us Heritage archives Image license terms

Search

   
⟶ ACL ⟶ Literature ⟶ Atlas manuals ⟶ Algol Library :: Atlas Algol Library
⟶ ACL ⟶ Literature ⟶ Atlas manuals ⟶ Algol Library :: Atlas Algol Library
ACL ACD C&A INF CCD CISD Archives
Further reading ⇓

□ Overview
□ 1-4 System
□ 5-11 Matrix
□ 12-20 System
□ 22-28 I/O
□ 29-31 Translators
□ 37-48 System
□ 50-59 Linear algebra
□ 60-69 Eigen
Equations
□ 70-74 Algebraic
□ 75-79 Differential
□ 80-84 Quadrature
□ 85-95 Approx
□ 96-99 Probability
□ 100-105 Numerische Mathematik
□ 106-110 Graphing

ICT96

            procedure classemarkoff(N,P,R,T,F);
integer N;
array P,R,T,F;

Calculation of non-recurring, transient, and persistent states of a Markoff chain from the boolean matrix P associated with the matrix of transition probabilities. N is the number of states, the non-recurring states are in R[1:N] (state i non-recurring if R[i] = 1), T[1:N] contains the transitory states (state i in transitory class k if T[i] = k), F[1:N] contains the final states (i in class k if F[i] = k). The arrays are declared real.

ICT97

            procedure sousclasse cyclique(N,P,L);
integer N;
array P,L;

Computation of cyclic sub-classes of a set of persistent states of a Markoff chain from the boolean matrix P associated with the stochastic matrix of order N. The results are in the rows of L[1:M,1:M] such that the ith subclass is represented by these elements of L such that L[i,j] = 1.

ICT98

            procedure polyweyl(A,X,R,K,M);
integer array A,X;
integer R,M,K;

Random vector X with R components independent, uniformly distributed in [0,1], in integer form with K digits in each component. We have to declare A,X[1:M+R] where M is the smallest integer satisfying M ≥ 109/K. The initial vector A can be formed from the first (M+R)K digits of π.

ICT99

            procedure notlag(T);
real T;

Inverse of the error function:

1 2 π ∫ - ∞ notlag T e - x 2 2 dx 1 2 π - ∞ notlag T e - x 2 2 dx 1 2 π - ∞ notlag ( T ) e - x 2 2 dx

⇑ Top of page
© Chilton Computing and UKRI Science and Technology Facilities Council webmaster@chilton-computing.org.uk
Our thanks to UKRI Science and Technology Facilities Council for hosting this site