递归算法 [1 1 1 0 0 0 1 0 0 1 1 0 0 0 1 1 1 1 0]

t=[0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1]

给权值赋初值

w1=eye(5,10)

w2=eye(10,5)

wr=eye(10,10)/3

wobias=eye(6,5)/4

wbias=eye(6,10)/3

x=ones(6,10)/3

ww2=zeros(10,5)/6

ww1=zeros(5,10)/6

wwr=zeros(10,10)/6

wwobias=zeros(6,5)/5

wwbias=zeros(6,10)/4

g=[1 1 1 1 1]

f=[1 1 1 1 1 1 1 1 1 1] -Recursive algorithm