C library that assists in studying and exploring the various formalizations of computability and effectively calculable partial functions.
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
README.md
a.out
buf.c
buf.h
buf.h.gch
comp.c
comp.h
comp.h.gch
comp_serialize.c
comp_serialize.h
comp_serialize.h.gch
comp_theory.pro
comp_theory.pro.user
lcalc.c
lcalc.h
lcalc.h.gch
main
main.c
tmachine.c
tmachine.h
tmachine.h.gch

README.md

libkompu

libkompu is a C library for building and evaluating expressions in the various formalizations of the notion of computability and effectively calculable partial functions:

  • The Turing Machine
  • Untypted Lambda (λ) Calculus
  • Primitive Recursiveness and Search

Computability theory, also known as recursion theory, is the area of mathematics concerned with the concept of an effective procedure—a procedure that can be carried out by following specifc rules.