Simple view
Full metadata view
Authors
Statistics
Non-normalizing S-terms
master
Alternative title
Nienormalizujące S-termy
Author
Bendkowski Maciej
Reviewer
Grygiel Katarzyna
Zaionc Marek
Advisor
Zaionc Marek
Date of defence
2014-09-18
Keywords in Polish
Logika kombinatoryczna, asymptotyczne gęstości, normalizacja, dowody wspierane przez komputer
Keywords in English
Combinatory logic, asymptotic densities, normalization, computer-assisted proofs
Language
English
Abstract in Polish
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.
Abstract in English
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.
Affiliation
Wydział Matematyki i Informatyki
| 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.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.affiliation | Wydział Matematyki i Informatyki | pl |
| dc.area | obszar nauk ścisłych | pl |
| dc.contributor.advisor | Zaionc, Marek - 132832 | pl |
| dc.contributor.author | Bendkowski, Maciej | pl |
| dc.contributor.departmentbycode | UJK/WMI2 | pl |
| dc.contributor.reviewer | Grygiel, Katarzyna | pl |
| dc.contributor.reviewer | Zaionc, Marek - 132832 | 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.fieldofstudy | informatyka analityczna | pl |
| dc.identifier.apd | diploma-89960-112440 | pl |
| dc.identifier.project | APD / O | pl |
| dc.identifier.uri | https://ruj.uj.edu.pl/xmlui/handle/item/198261 | |
| dc.language | eng | pl |
| dc.subject.en | Combinatory logic, asymptotic densities, normalization, computer-assisted proofs | pl |
| dc.subject.pl | Logika kombinatoryczna, asymptotyczne gęstości, normalizacja, dowody wspierane przez komputer | pl |
| dc.title | Non-normalizing S-terms | pl |
| dc.title.alternative | Nienormalizujące S-termy | pl |
| dc.type | master | pl |
| dspace.entity.type | Publication |
dc.abstract.enpl
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. dc.abstract.plpl
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. dc.affiliationpl
Wydział Matematyki i Informatyki dc.areapl
obszar nauk ścisłych dc.contributor.advisorpl
Zaionc, Marek - 132832 dc.contributor.authorpl
Bendkowski, Maciej dc.contributor.departmentbycodepl
UJK/WMI2 dc.contributor.reviewerpl
Grygiel, Katarzyna dc.contributor.reviewerpl
Zaionc, Marek - 132832 dc.date.accessioned
2020-07-25T03:39:05Z dc.date.available
2020-07-25T03:39:05Z dc.date.submittedpl
2014-09-18 dc.fieldofstudypl
informatyka analityczna dc.identifier.apdpl
diploma-89960-112440 dc.identifier.projectpl
APD / O dc.identifier.uri
https://ruj.uj.edu.pl/xmlui/handle/item/198261 dc.languagepl
eng dc.subject.enpl
Combinatory logic, asymptotic densities, normalization, computer-assisted proofs dc.subject.plpl
Logika kombinatoryczna, asymptotyczne gęstości, normalizacja, dowody wspierane przez komputer dc.titlepl
Non-normalizing S-terms dc.title.alternativepl
Nienormalizujące S-termy dc.typepl
master dspace.entity.type
Publication Affiliations
No affiliation
Bendkowski, Maciej
Grygiel, Katarzyna
Zaionc, Marek
* The migration of download and view statistics prior to the date of April 8, 2024 is in progress.
Views
1
Views per month
Views per city
Katowice
1