AFTD Auto-Formalizing Theoretical Domains

Cslib.URM.Computable

defimported Lean

A partial function f : (Fin n → ℕ) → Part ℕ is URM-computable if there exists a URM program that computes it.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
def Cslib.URM.Computable (n : ℕ) (f : (Fin n → ℕ) → Part ℕ) : Prop
Defined in
CSLib, `Cslib.URM.Computable`
Lean proof
By Jesse Alama, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Jesse Alama. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
Verified
08 Oct 2026
Axioms
none listed
Built on 6

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- A partial function `f : (Fin n → ℕ) → Part ℕ` is URM-computable if there exists a URM program that computes it. -/
def Cslib.URM.Computable (n : ℕ) (f : (Fin n → ℕ) → Part ℕ) : Prop :=
  ∃ p : Program, Computes n p f
See it in the graphDiscuss this resultChallenge it