Induction and Recursion

[semtex]

 

[zerozero]

what's induction?

in practice in programming recursion is best avoided but understanding how it works is really important if you want to have a programming mind

 

[Dat Migo]

As in proofs?

 

[semtex]

what's induction?

in practice in programming recursion is best avoided but understanding how it works is really important if you want to have a programming mind

Recursion in programming is easy I'm talkin bout discrete proofs

 

[Type Username Here]

Recursion and induction proofs...

Oh lord. That shyt was a nightmare for me.

 

[Type Username Here]

what's induction?

in practice in programming recursion is best avoided but understanding how it works is really important if you want to have a programming mind

Best avoided? Surely in some cases that is true, but outright avoided? Are you talking about recursion elimination using stacks?

 

[zerozero]

Best avoided? Surely in some cases that is true, but outright avoided? Are you talking about recursion elimination using stacks?

I've never practically needed to use recursion in real world work but maybe the stuff I do is just not hardcore enough lol

well I wrote a recursive function once for directory traversal

I'm just saying if I end up writing some code where I'm doing recursion I'd think twice about whether I'm just trying to be clever or if this is the best thing to do

so I guess my statement was too authoritative sounding, it's just my off-hand opinion, I don't have any hard info for or against using recursion

 

[semtex]

It's so annoying u can be good at programming but have to take and pass all these outlandish math courses

 

[semtex]

what's induction?

in practice in programming recursion is best avoided but understanding how it works is really important if you want to have a programming mind

Induction is being given P(k) and proving that P(k) implies P(k+1). In theory it seems simple but applying it is a bytch especially if you aren't great at algebra.

 

[zerozero]

Induction is being given P(k) and proving that P(k) implies P(k+1). In theory it seems simple but applying it is a bytch especially if you aren't great at algebra.

sounds complex one day I need to go back and learn this stuff

 

[semtex]

sounds complex one day I need to go back and learn this stuff

Run mayne

 

[null]

what's induction?

in practice in programming recursion is best avoided but understanding how it works is really important if you want to have a programming mind

neg

often functional languages have no loops i.e. ONLY recursion no iteration possible in the languages.

e.g.

fac (0): 0
fac (n): 1 + fac (n-1)

also:

there are function classes which can only be written recursively.

 

[null]

@zerozero



call your spaghetti "code" brehs

 

[zerozero]

neg

often functional languages have no loops i.e. ONLY recursion no iteration possible in the languages.

e.g.

fac (0): 0
fac (n): 1 + fac (n-1)

also:

there are function classes which can only be written recursively.

Okay, you let me know when a billion dollar biz is built on pure Lisp

 

[null]

Okay, you let me know when a billion dollar biz is built on pure Lisp

oddly specific for a logic driven programmer ...

although it is not the norm for a company to use just one language

1. blockchain: ADA uses haskell



2. backbone telecom routing runs on Erlang incl Whatsapp





3. SQL (core ANSI) is declarative i.e. ignore MS, focus on Codd

the value of SQL in industry is .... incalculable

-

are you still a "programmer" ?