Journal of Logic, Mathematics and Linguistics in Applied Sciences
http://dergipark.ulakbim.gov.tr/jlmlas
<em><strong>An international peer reviewed research journal.</strong></em>en-USselcuk.topal@yandex.com (Selçuk TOPAL)selcuk.topal@yandex.com (Selçuk TOPAL)Thu, 18 May 2017 00:00:00 +0300OJS 2.4.3.0http://blogs.law.harvard.edu/tech/rss60On the Fundamental Theorem of Arithmetic and Euclid's Theorem
http://dergipark.ulakbim.gov.tr/jlmlas/article/view/5000191785
We 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.Hendra Gunawanhttp://dergipark.ulakbim.gov.tr/jlmlas/article/view/5000191785Wed, 17 May 2017 00:00:00 +0300Hypercomputation and Non-computable Functions
http://dergipark.ulakbim.gov.tr/jlmlas/article/view/5000213699
<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>Ahmet Çevikhttp://dergipark.ulakbim.gov.tr/jlmlas/article/view/5000213699Thu, 18 May 2017 00:00:00 +0300