Jagiellonian University Repository

Non-normalizing S-terms

pcg.skipToMenu

Non-normalizing S-terms

Show full item record

dc.contributor.advisor Zaionc, Marek [SAP11009271] pl
dc.contributor.author Bendkowski, Maciej pl
dc.date.accessioned 2020-07-25T03:39:05Z
dc.date.available 2020-07-25T03:39:05Z
dc.date.submitted 2014-09-18 pl
dc.identifier.uri https://ruj.uj.edu.pl/xmlui/handle/item/198261
dc.language eng pl
dc.title Non-normalizing S-terms pl
dc.title.alternative Nienormalizujące S-termy pl
dc.type master pl
dc.abstract.pl We present a computer-assisted proof of the least combinatory logic term without normal form, i.e. the smallest program without the halting property expressible in the language of combinatory logic, and use it to study the asymptotic density of weakly normalizing terms in combinatory logic. pl
dc.abstract.en We present a computer-assisted proof of the least combinatory logic term without normal form, i.e. the smallest program without the halting property expressible in the language of combinatory logic, and use it to study the asymptotic density of weakly normalizing terms in combinatory logic. pl
dc.subject.pl Logika kombinatoryczna, asymptotyczne gęstości, normalizacja, dowody wspierane przez komputer pl
dc.subject.en Combinatory logic, asymptotic densities, normalization, computer-assisted proofs pl
dc.contributor.reviewer Grygiel, Katarzyna pl
dc.contributor.reviewer Zaionc, Marek [SAP11009271] pl
dc.affiliation Wydział Matematyki i Informatyki pl
dc.identifier.project APD / O pl
dc.identifier.apd diploma-89960-112440 pl
dc.contributor.departmentbycode UJK/WMI2 pl
dc.area obszar nauk ścisłych pl
dc.fieldofstudy informatyka analityczna pl


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)