http://dergipark.ulakbim.gov.tr/jlmlas/issue/feedJournal of Logic, Mathematics and Linguistics in Applied Sciences2017-12-13T21:35:10+02:00Selçuk TOPALselcuk.topal@yandex.comOpen Journal Systems<em><strong>An international peer reviewed research journal.</strong></em>http://dergipark.ulakbim.gov.tr/jlmlas/article/view/5000191785On the Fundamental Theorem of Arithmetic and Euclid's Theorem2017-05-18T10:09:43+03:00Hendra Gunawanhgunawan@math.itb.ac.idWe encounter a circular argument in the proofs of Euclid’s theorem on<br />the infinitude of primes that rely on the Fundamental Theorem of Arithmetic. We discover this by carefully observing the set of primes involved in the statement.2017-05-17T00:00:00+03:00http://dergipark.ulakbim.gov.tr/jlmlas/article/view/5000213699Hypercomputation and Non-computable Functions2017-12-13T21:35:10+02:00Ahmet Çevika.cevik@hotmail.com<div class="page" title="Page 1"><div class="layoutArea"><div class="column"><p><span>Hypercomputation is an infinite computation performed in finitely many steps. In this paper we review with a personal perspective, transfinite computability, also known as hypercomputation, non-computable functions, and hypercomputing models following two main approaches: Ordinal computation and relativistic physics. For this we consider infinite time Turing machines as a model of ordinal computability. We give some of the well known results regarding infinite time Turing machines and give a personal perspective on the notion of computability based on ordinal numbers. </span></p></div></div></div>2017-05-18T00:00:00+03:00