You mean Turing machine itself is fundamental unit, like all programs are built from small Turing machines? Or minimal set of parts from which you can construct Turing machine?
something changes the state of another thing
Sounds like a concept of state machine
both the turing machine and lambda calculus
Well yes, but lambda calculus is pure so you can't have any side effects, like getting date or generate random number or read user input. To do IO with lambda calculus you need to use monads ¯\_(ツ)_/¯
Yea, the turing machine is essentially the fundamental unit of programming. As that is where the term turing complete comes from I believe which implies that any general logic can be expressed with something turing complete.
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
You mean Turing machine itself is fundamental unit, like all programs are built from small Turing machines? Or minimal set of parts from which you can construct Turing machine?
Sounds like a concept of state machine
Well yes, but lambda calculus is pure so you can't have any side effects, like getting date or generate random number or read user input. To do IO with lambda calculus you need to use monads
¯\_(ツ)_/¯
Yea, the turing machine is essentially the fundamental unit of programming. As that is where the term turing complete comes from I believe which implies that any general logic can be expressed with something turing complete.