Simplify the following text for a Grade 9 native English-speaking person.
Original: Examples of particular abstract machines which are deterministic include the deterministic Turing machine and deterministic finite automaton .
Simplified: A deterministic algorithm is a computer science term . Functions are deterministic when if you never change what you give it ( the input ) , that what you get out ( the output ) never changes either ; and you can do this as many times as you want .