| | |
Find something wrong on a Theorem
Please support our Computer Science advertiser: Learn about neural networks and artificial intelligence.
![]() |
•
•
Join Date: Oct 2008
Posts: 6
Reputation:
Solved Threads: 0
Dear All,
Can you help me to find something wrong on the following theorem :
THEOREM 2 : if A and B are WSO(n1, a,b) and WSO(n2,c,d). respectively, where b>=c, then A(n1) * B(n2) is WSO(n1+n2-1, a,b-c+d) with depth max {d(A),d(B)+b-c} and fan-out max{fo(A),fo(B)}
THEOREM 3 : H(n) is WSO(n,r,r+1) with depth 2r+1 and fan-out 2, where r=[;g(n-1)]
LEMMA 5, HD(i) is WSO(2powi+1, i, 2i+1) with depth 2i+1 and fan-out 2, where i>=0,
PROOF. We shall prove by induction on i
Base Step. From Theorem 3, the H(2pow0 +1) circuit is WSO(2pow0 +1,0,1) with dept 1 and fan out 2
Induction Step: Assume that HD(j) is WSO(2powj+1, j, 2j+1) with depth 2j+1 and fan out 2. From theorem 3, H(2powj+1 +1) is WSO(2powj+1 +1,j+1,j+2) with depyh 2j+3 and fan-out 2. Since HD(j+1)=H(2powj+1 +1) * HD(j), from Theorem 2, HD(j+1) is WSO(2powj+2, j+1,2j+3) with depth 2j+3 and fan out 2.
Rhank you very much.
regards,
ming
Can you help me to find something wrong on the following theorem :
THEOREM 2 : if A and B are WSO(n1, a,b) and WSO(n2,c,d). respectively, where b>=c, then A(n1) * B(n2) is WSO(n1+n2-1, a,b-c+d) with depth max {d(A),d(B)+b-c} and fan-out max{fo(A),fo(B)}
THEOREM 3 : H(n) is WSO(n,r,r+1) with depth 2r+1 and fan-out 2, where r=[;g(n-1)]
LEMMA 5, HD(i) is WSO(2powi+1, i, 2i+1) with depth 2i+1 and fan-out 2, where i>=0,
PROOF. We shall prove by induction on i
Base Step. From Theorem 3, the H(2pow0 +1) circuit is WSO(2pow0 +1,0,1) with dept 1 and fan out 2
Induction Step: Assume that HD(j) is WSO(2powj+1, j, 2j+1) with depth 2j+1 and fan out 2. From theorem 3, H(2powj+1 +1) is WSO(2powj+1 +1,j+1,j+2) with depyh 2j+3 and fan-out 2. Since HD(j+1)=H(2powj+1 +1) * HD(j), from Theorem 2, HD(j+1) is WSO(2powj+2, j+1,2j+3) with depth 2j+3 and fan out 2.
Rhank you very much.
regards,
ming
Is this your reaserch topic or homework ?
![]() |
Other Threads in the Computer Science Forum
- Previous Thread: create non deterministic finite automaton
- Next Thread: Question about UML
| Thread Tools | Search this Thread |
ai algorithm algorithms amazon assignment assignmenthelp assignments automata battery bigbrother binary bittorrent bizarre bletchleypark blogging bomb business cern codebreaker compiler computer computers computerscience computertrackingsoftware connect conversion csc dataanalysis dataintepretation development dfa dissertation dissertations dissertationthesis dissertationtopic ebook employment energy floatingpoint foreclosure foreclosuresoftware fuel gadgets geeks givemetehcodez government graphics hardware homeowners homeworkassignment homeworkhelp humor ibm idea ideas internet iphone itcontracts jobs kindle laser linkbait lsmeans mainframes marketing mobileapplication msaccess nano netbeans networking news os p2p piracy piratebay principles programming rasterizer research sam-being-cute sas science security sex simulation software spying stephenfry study supercomputer supercomputing sweden technology textfield turing turingtest two'scompliment uk virus ww2






