Sökning: "Nora Szasz"
Hittade 2 avhandlingar innehållade orden Nora Szasz.
1. A machine checked proof that Ackermann's function is not primitive recursive
Sammanfattning : .... LÄS MER
2. A Theory of Specifications Programs and Proofs
Sammanfattning : Using Martin-Löf's set theory as a programming logic one identifies specifications with sets and propositions and, correspondingly, programs with elements of sets and with proofs. Then, programs happen to contain something else than just what is needed to perform computations. LÄS MER
Resultatsidor:
1