File size: 1,324 Bytes
986b7a8 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 | {
"acceptedNearTies" : 0,
"allocatedCapacity" : 256,
"argmaxMismatches" : 0,
"cacheGrowths" : 0,
"device" : "h17c",
"forcedRows" : 64,
"greedyDivergenceAccepted" : true,
"greedyIdentical" : true,
"greedyTokens" : [
198,
50284,
361,
299,
19841,
352,
25,
198,
50280,
7783,
299,
198,
50284,
17772,
25,
198,
50280,
7783,
12900,
261,
44456,
7,
77,
12,
16,
8,
1343,
12900,
261,
44456,
7,
77,
12,
17,
8,
198,
198,
4798,
7,
69,
571,
261,
44456,
7,
940,
4008,
198,
15506,
63,
198,
198,
2235,
7275,
362,
25,
3311,
24197,
290,
4942,
78,
1634,
198,
198,
6690
],
"maximumAbs" : 0.5389232635498047,
"minimumCosine" : 0.9984728627398196,
"modelReloads" : 0,
"modelSHA256" : "8b2a3f6388406f183163440449aced556008f05e6b7a0308b1d423bc2ce79085",
"passed" : true,
"sourceRepository" : "microsoft/phi-2",
"sourceRevision" : "9a5117d15e407c48fa40f8adbac1244abae52d6f",
"text" : "\n if n <= 1:\n return n\n else:\n return fibonacci(n-1) + fibonacci(n-2)\n\nprint(fibonacci(10))\n```\n\n## Section 2: Recursion and Memoization\n\nRec"
} |