```python
def babylonian_squareroot(number):
    """
    Computes the square root of a non-negative number using the Babylonian method.
    """
    if number == 0:
        return 0

    # Start with an initial guess. Using the number itself is a simple choice.
    guess = float(number)
    
    # A small tolerance to determine when the guess is accurate enough.
    tolerance = 1e-12

    while True:
        # Calculate the next guess using the Babylonian formula.
        next_guess = 0.5 * (guess + number / guess)

        # Check if the difference between the current and next guess is within the tolerance.
        # If it is, we have converged on a solution.
        if abs(guess - next_guess) < tolerance:
            return next_guess

        # Update the guess for the next iteration.
        guess = next_guess
```