meta / codellama-34b-instruct

A 34 billion parameter Llama tuned for coding and conversation

  • Public
  • 155.4K runs
  • L40S
  • GitHub
  • Paper
  • License
Iterate in playground
  • Prediction

    meta/codellama-34b-instruct:bf86bd92b9dfc81992d7e4ed4c890a3693819d437279a077a9259675048370d1
    ID
    zpxk7d3bg77zrkru3iiwafxzia
    Status
    Succeeded
    Source
    Web
    Hardware
    A40 (Large)
    Total duration
    Created
    by @replicate

    Input

    debug
    top_k
    50
    top_p
    0.9
    prompt
    Write a function that sums 2 integers together, and returns the result.
    temperature
    0.75
    system_prompt
    Responses should be written in TypeScript.
    max_new_tokens
    128
    min_new_tokens
    -1

    Output

    function sumIntegers(a: number, b: number): number { return a + b; }
    Generated in
  • Prediction

    meta/codellama-34b-instruct:bf86bd92b9dfc81992d7e4ed4c890a3693819d437279a077a9259675048370d1
    ID
    sutmy7lbjedzzpcpseisujre2i
    Status
    Succeeded
    Source
    Web
    Hardware
    A40 (Large)
    Total duration
    Created

    Input

    debug
    top_k
    50
    top_p
    0.9
    prompt
    Write a python function that sums 2 integers together, and returns the result.
    temperature
    0.75
    system_prompt
    Responses should be written in python.
    max_new_tokens
    128
    min_new_tokens
    -1

    Output

    def sum_integers(a, b): return a + b
    Generated in
  • Prediction

    meta/codellama-34b-instruct:8281a5c610f6e88237ff3ddaf3c33b56f60809e2bdd19fbec2fda742aa18167e
    ID
    3su2xgdbbrk4yvy2jqldvx344a
    Status
    Succeeded
    Source
    Web
    Hardware
    A40 (Large)
    Total duration
    Created
    by @meta

    Input

    top_k
    50
    top_p
    0.9
    prompt
    Write a function that returns the fibonnaci sequence, and also talk like a pirate.
    max_tokens
    500
    temperature
    0.75
    system_prompt
    Responses should be written in Python.
    repeat_penalty
    1.1
    presence_penalty
    0
    frequency_penalty
    0

    Output

    Arrgh, here be me code for ye, matey: ``` def fibonacci(n): if n <= 1: return n else: return fibonacci(n-1) + fibonacci(n-2) ``` Now, let's break down the code and talk like pirates, savvy? The function starts with a simple check: if the input `n` is less than or equal to 1, we just return it as the first two numbers in the sequence are 0 and 1. This be called the "base case." ``` if n <= 1: return n ``` But if the input `n` be greater than 1, we have a bit more work to do. We use a recursive call to find the previous two numbers in the sequence by calling the function again with `n-1`. This be called the "recursive case." ``` else: return fibonacci(n-1) + fibonacci(n-2) ``` Now, let's talk like pirates. The first two numbers in the sequence be 0 and 1, just like on the high seas. The next number be 1+1=2, which be like a ship with two masts. Then it be 1+2=3, which be like a ship with three masts. And so on and so forth. ``` 0, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765 ``` So there ye have it, me hearty. The fibonacci sequence be a series of numbers that start with 0 and 1, and each number after that be the sum of the two before it. And if ye ever find yerself lost at sea, just remember: fibonacci be the answer to all yer problems!
    Generated in

Want to make some of these yourself?

Run this model