function m = f(A)
a = diag(A);
n = length(A);
for i = 1:n
    u(i) = g(a(i));
end
m = min(u);
u = u - m + 1; % Ensures min(u) = 1;
% Remove any gaps from the integer sequence in u.
uq = unique(u); % The unique values in u.
for i = 1:length(u)
    m(i) = find(u(i) == uq);  <------- what?
end

State 0 read 0 write 0 move left goto state 2
State 0 read 1 write 0 move left goto state 3
State 1 read 0 write 0 move left goto state 3
State 1 read 1 write 0 move left goto state 4
State 2 read 0 write 0 move left goto state 0
State 2 read 1 write 1 move left goto state 0
State 3 read 0 write 1 move left goto state 0
State 3 read 1 write 0 move left goto state 1
State 4 read 0 write 0 move left goto state 1
State 4 read 1 write 1 move left goto state 1

ohai "This script will install:"

Julia        n->isprime(n)&&error()
Mathematica  PrimeQ@#&&1/0&
J            (p:*#:)&0
J            1&{@q:
Jolf         Έ?m{
Pyth         htP

ÆPNX      Main monadic link. Argument: n
ÆP        Tests if n is a prime.
    N     Negates it.
      X   black magic

n=>[...Array(n-2)].map((_,i)=>i+2).every(x=>n%x)

  File "/usr/lib/python3.4/random.py", line 255, in choice
    raise IndexError('Cannot choose from an empty sequence')

def q(s):
 t=list;n=len;e=enumerate;z=t(t(map(int,t(m)))for m in s.split());d=t([0]*(max(map(n,z))-n(j))+j for j in z);x=['']*n(z)
 for i,a in e(d):
  for j,c in e(a):m=max(t(zip(*d))[j]);x[i]+="|"*(m-c+0**m+(j>0))+":8."[(c<2)|-(j<n(a)-1)]*c
 for r in zip(*x):print(*r,sep='')

n=>[...Array(n-2)].map((_,i)=>i+2).every(x=>n%x)&&t

JavaScript   n=>[...Array(n-2)].map((_,i)=>i+2).every(x=>n%x)&&t
Python       lambda n:[x for x in range(1,n)if n/x*x==n][1]
Julia        n->isprime(n)&&error()
Mathematica  PrimeQ@#&&1/0&
J            (p:*#:)&0
J            1&{@q:
Jolf         Έ?m{
Pyth         htP

Pyth         htP
Jolf         Έ?m{
Jelly        ÆPNX
J            1&{@q:
J            (p:*#:)&0
Mathematica  PrimeQ@#&&1/0&
Julia        n->isprime(n)&&error()
Python       lambda n:[x for x in range(1,n)if n/x*x==n][1]
JavaScript   n=>[...Array(n-2)].map((_,i)=>i+2).every(x=>n%x)&&t

f=x=>x?x*f(x-1):1;n=>f(n-1)%n==n-1

Pyth         htP
Jolf         Έ?m{
Jelly        ÆPNX
J            1&{@q:
J            (p:*#:)&0
Mathematica  PrimeQ@#&&1/0&
Julia        n->isprime(n)&&error()
JavaScript   f=x=>x?x*f(x-1):1;g=n=>f(n-1)%n==n-1&&t
Python       lambda n:[x for x in range(1,n)if n/x*x==n][1]
JavaScript   n=>[...Array(n-2)].map((_,i)=>i+2).every(x=>n%x)&&t

        except:
            if self.debug_mode:
                traceback.print_exc()

def p(s):
 e=enumerate;f=lambda x:f(x//10)+[x%10]if x else[];z=list(map(f,s));d=[[0]*(max(map(len,z))-len(j))+j for j in z];x=['']*len(z)
 for i,a in e(d):
  for j,c in e(a):m=max(list(zip(*d))[j]);x[i]+="|"*(m-c+0**m+(j>0))+":8."[(c<2)|-(j<len(a)-1)]*c
 for r in zip(*x):print(*r,sep='')

def all_solutions():
    n = 7
    available_digits = set(range(n))

    def construct_grid(grid):
        if len(grid) == n**2:
            yield grid
        if len(grid) % n == 0:
            grid.append(len(grid)/n)
        position = len(grid)
        row = grid[(position/n)*n:]
        column = grid[position % n::n]
        remaining = available_digits.difference(row, column)
        for r in remaining:
            new_grid = grid[:]
            new_grid.append(r)
            for g in construct_grid(new_grid):

 2
 3  3
 5  5  5
 5  5  5  5
 7  7  7  7  7
 7  7  7  7  7  7
11 11 11 11 11 11 11
11 11 11 11 11 11 11 11
11 11 11 11 11 11 11 11 11

Pyth       *]fP_TQ
J          ]*4&p:

def p(s):
 e=enumerate;f=lambda x:f(x//10)+[x%10]if x else[];z=list(map(f,s));d=[[0]*(max(map(len,z))-len(j))+j for j in z];x=['']*len(z)
 for i,a in e(d):
  for j,c in e(a):m=max(list(zip(*d))[j]);x[i]+="|"*(m-c+0**m+(j>0))+":8."[(c<2)|-(j<len(a)-1)]*c
 for r in zip(*x):print(*r,sep='')

Ænx

Ænx Main monadic link, argument:n
Æn  first prime strictly greater than n
  x repeat n times

# 279 bytes
def q(s):
 e=enumerate;z=list(map(lambda n:list(map(int,str(n))),s));d=[[0]*(max(map(len,z))-len(j))+j for j in z];x=['']*len(z)
 for i,a in e(d):
  for j,c in e(a):m=max(list(zip(*d))[j]);x[i]+="|"*(m-c+0**m+(j>0))+":8."[(c<2)|-(j<len(a)-1)]*c
 for r in zip(*x):print(*r,sep='')

Pyth       *]fP_ThQ
J          ]#4&p:
Jelly      Ænx