Na videz nemogoči funkcionali

delo diplomskega seminarja

Tine Makovecki (Author), Andrej Bauer (Mentor)

Abstract

V delu obravnavamo računalniško implementacijo funkcionala izbire na Cantorjevi množici. Utemeljimo, da lahko predikate na Cantorjevi množici predstavimo z dvojiškimi drevesi in da nam ta predstavitev pomaga pri implementaciji funkcionala izbire. Dokažemo, da so funkcionali, ki jih obravnavamo, izračunljivi in da so drevesa, ki jih v postopku uporabimo, končna. Funkcional izbire implementiramo v programskem jeziku OCaml na različne načine, ki jih med seboj tudi primerjamo.

Keywords

matematika;funkcional izbire;Cantorjeva množica;funkcijsko programiranje;funkcionali;drevesa;izračunljivost;

Data

Language:	Slovenian
Year of publishing:	2018
Typology:	2.11 - Undergraduate Thesis
Organization:	UL FMF - Faculty of Mathematics and Physics
Publisher:	[T. Makovecki]
UDC:	004
COBISS:	18478425
Views:	713
Downloads:	225
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Seemingly impossible functionals
Secondary abstract:	In this work we discuss the implementation of the selection functional on the Cantor set. We show that continous predicates on the Cantor set can be represented with binary trees and that this representation helps implement the selection functional. It is proven that the functional we discuss is computable and the trees we use are finite. We implement the selection functional in the programming language OCaml in several ways, which we later compare.
Secondary keywords:	mathematics;selection functional;Cantor set;functional programming;functionals;trees;computability;
Type (COBISS):	Final seminar paper
Study programme:	0
Embargo end date (OpenAIRE):	1970-01-01
Thesis comment:	Univ. v Ljubljani, Fak. za matematiko in fiziko, Oddelek za matematiko, Matematika - 1. stopnja
Pages:	29 str.
ID:	10961435