Zelebg wrote: ↑Thu Nov 07, 2019 12:45 pm
Computing has nothing to do with numbers, eh? I'll just laugh and ignore that since you have taken too much of my time already. Anyhow, you were not talking about "Computer Science", I was.
Are you a computer scientist? I am...
Computing has nothing to do with numbers because numbers don't exist. if your religion is Mathematics - say so.
Zelebg wrote: ↑Thu Nov 07, 2019 12:45 pm
The main form of computability studied in recursion theory was introduced by Turing (1936). A set of natural numbers is said to be a computable set (also called a decidable, recursive, or Turing computable set) if there is a Turing machine that... https://en.m.wikipedia.org/wiki/Computability_theory
But it's not 1936 anymore. It's 2019. We picked up where Turing and Church left off and added to it. A lot has happened in 83 years. Much new knowledge has been acquired. We have PLT (
https://en.wikipedia.org/wiki/Programmi ... age_theory ) which is an intersection of mathematics, software engineering, linguistics and even cognitive science.
Zelebg wrote: ↑Thu Nov 07, 2019 12:45 pm
It actually says recursion is different than iteration. You are only completely wrong.
Computability theory proves that these recursive-only languages are Turing complete; are as computationally powerful as Turing complete imperative languages, meaning they can solve the same kinds of problems as imperative languages even without iterative control structures such as while and for
In English. Recursion and Iteration are both Turing-complete, therefore they are Turing-equivalent. Different form - same function.
They produce the exact same same result. It's called confluence (
https://en.wikipedia.org/wiki/Confluenc ... rewriting) ).
The distinction of the different formalist paradigms is studied in Programming Language Theory.
This should cure your ignorance:
https://en.wikipedia.org/wiki/Programming_paradigm
Imperative, iterative, declarative or recursive are just different paradigms of programming, but ultimately they all do the exact same thing - they are different languages for expressing computations.
Zelebg wrote: ↑Thu Nov 07, 2019 12:45 pm
So you understand neither iteration nor recursion, you even lack basic understanding of words. And you say you're a computer scientist?! Hahahaaa! You are just a kid. Baby philosopher! How cute.
You can SAY that I am wrong, but your words are meaningless when I am DEMONSTRATING that I am right.
You seem to be projecting - I am not a philosopher. I am a scientist - sience trumps philosophy.
In the face of the evidence below, you are either a liar, ignoramus or both.
https://repl.it/repls/MediumIgnorantProlog
Code: Select all
# Revealing Zelebg's ignorance by demonstrating the
# Turing-equivalence of recursion and iteration.
# --Skepdick
# Two implementations of sumation
def iteration(n):
s = 0
for x in range(1,n+1):
s = s + x
return(s)
def recursion(n):
if n == 1:
return 1
else:
return n + recursion(n-1)
print("Summing up all numbers up to 500 with iteration: {}".format(iteration(500)))
print("Summing up all numbers up to 500 using recursion: {} ".format(recursion(500)))
It took me a minute to write the above algorithms. If you had any clue what you were talking about then you should have no problem demonstrating it with some of your own work in a Programming language of your choice.