Discrete function is also a math function?Teaching “math function” vs. “CS function”How do I teach...
Is there precedent or are there procedures for a US president refusing to concede to an electoral defeat?
Is any special diet an effective treatment of autism?
Make me a minimum magic sum
Looking for sci-fi book based on Hinduism/Buddhism
How do I, as a DM, handle a party that decides to set up an ambush in a dungeon?
Should I simplify my writing in a foreign country?
Counting the Number of Real Roots of A Polynomial
Understanding ties
What Kind of Wooden Beam is this
Is it normal for gliders not to have attitude indicators?
Hostile Divisor Numbers
Drawing an hexagonal cone in TikZ 2D
Gerrymandering Puzzle - Rig the Election
The origin of list data structure
What is the closest airport to the center of the city it serves?
How to preserve a rare version of a book?
Disabling quote conversion in docstrings
Why would a military not separate its forces into different branches?
My large rocket is still flipping over
How to pass query parameters in URL in Salesforce Summer 19 Release?
How can I evaluate this integral
Why is my arithmetic with a long long int behaving this way?
Discrete function is also a math function?
Clarification of algebra in moment generating functions
Discrete function is also a math function?
Teaching “math function” vs. “CS function”How do I teach “math equality” vs. “CS assignment” vs. “CS equality logic operator”?Teaching “CS integer” vs. “math integer”
$begingroup$
Here is a table of the Staten Island subway:
| STOP | STATION |
|------+-----------------|
| 1 | St. George |
| 2 | Tomkinsville |
| 3 | Stapleton |
| 4 | Clifton |
| 5 | Grasmere |
| 6 | Old Town |
| 7 | Dongan Hills |
| 8 | Jefferson |
| 9 | Grant |
| 10 | New Dorp |
| 11 | Oakwood Heights |
| 12 | Bay Terrace |
| 13 | Great Kills |
| 14 | Eltingville |
| 15 | Annadale |
| 16 | Hugenot |
| 17 | Prince’s Bay |
| 18 | Pleasant Plains |
| 19 | Richmond Valley |
| 20 | Arthur Kill |
| 21 | Tottenville |
and here is an Elisp function that maps a number to a name:
(defun sisubstops (s)
(pcase s
((pred (or (< s 1) (> s 21))) (message "Hey, just stops 1 through 21, please!"))
('1 (message "St. George"))
('2 (message "" Tomkinsville))
('3 (message "Stapleton"))
('4 (message " Clifton"))
('5 (message " Grasmere"))
('6 (message " Old Town"))
('7 (message " Dongan Hills"))
('8 (message " Jefferson"))
('9 (message " Grant"))
('10 (message " New Dorp"))
('11 (message " Oakwood Heights"))
('12 (message " Bay Terrace"))
('13 (message " Great Kills"))
('14 (message " Eltingville"))
('15 (message " Annadale"))
('16 (message " Hugenot"))
('17 (message " Prince’s Bay"))
('18 (message " Pleasant Plains"))
('19 (message " Richmond Valley"))
('20 (message " Arthur Kill"))
('21 (message " Tottenville"))))
So, when I'm trying to tell students that this is a function of a basically non-continuous phenomenon, i.e., we're not dealing with a function like f(x) = x^2
, rather a function that matches stops to names -- but it is still a function -- how can I get this across. One idea would be to got deep into Lambda Calculus and talk about how LC does conditionals. My first goal is to distinguish between continuous versus discrete; and yet I've written a Lisp function that can't really be represented as any sort of normal math function e.g., S(n) = M*n
where M
is some sort of machine or constant that takes a stop number and turns it into a stop name. Any ideas how, yes, this is a function? Or is this just a misnomer, i.e., comp-sci using/abusing the term function. So yes, how is sisubstops
really a function?
functional-programming mathematics
$endgroup$
migrated from softwareengineering.stackexchange.com 2 hours ago
This question came from our site for professionals, academics, and students working within the systems development life cycle.
add a comment |
$begingroup$
Here is a table of the Staten Island subway:
| STOP | STATION |
|------+-----------------|
| 1 | St. George |
| 2 | Tomkinsville |
| 3 | Stapleton |
| 4 | Clifton |
| 5 | Grasmere |
| 6 | Old Town |
| 7 | Dongan Hills |
| 8 | Jefferson |
| 9 | Grant |
| 10 | New Dorp |
| 11 | Oakwood Heights |
| 12 | Bay Terrace |
| 13 | Great Kills |
| 14 | Eltingville |
| 15 | Annadale |
| 16 | Hugenot |
| 17 | Prince’s Bay |
| 18 | Pleasant Plains |
| 19 | Richmond Valley |
| 20 | Arthur Kill |
| 21 | Tottenville |
and here is an Elisp function that maps a number to a name:
(defun sisubstops (s)
(pcase s
((pred (or (< s 1) (> s 21))) (message "Hey, just stops 1 through 21, please!"))
('1 (message "St. George"))
('2 (message "" Tomkinsville))
('3 (message "Stapleton"))
('4 (message " Clifton"))
('5 (message " Grasmere"))
('6 (message " Old Town"))
('7 (message " Dongan Hills"))
('8 (message " Jefferson"))
('9 (message " Grant"))
('10 (message " New Dorp"))
('11 (message " Oakwood Heights"))
('12 (message " Bay Terrace"))
('13 (message " Great Kills"))
('14 (message " Eltingville"))
('15 (message " Annadale"))
('16 (message " Hugenot"))
('17 (message " Prince’s Bay"))
('18 (message " Pleasant Plains"))
('19 (message " Richmond Valley"))
('20 (message " Arthur Kill"))
('21 (message " Tottenville"))))
So, when I'm trying to tell students that this is a function of a basically non-continuous phenomenon, i.e., we're not dealing with a function like f(x) = x^2
, rather a function that matches stops to names -- but it is still a function -- how can I get this across. One idea would be to got deep into Lambda Calculus and talk about how LC does conditionals. My first goal is to distinguish between continuous versus discrete; and yet I've written a Lisp function that can't really be represented as any sort of normal math function e.g., S(n) = M*n
where M
is some sort of machine or constant that takes a stop number and turns it into a stop name. Any ideas how, yes, this is a function? Or is this just a misnomer, i.e., comp-sci using/abusing the term function. So yes, how is sisubstops
really a function?
functional-programming mathematics
$endgroup$
migrated from softwareengineering.stackexchange.com 2 hours ago
This question came from our site for professionals, academics, and students working within the systems development life cycle.
2
$begingroup$
Huh, functions are routinely explained via tables, or via set theory where elements of the domain are mapped to elements in the codomain. Without the set theory explanation (which didactically works best with finite sets), it's unnecessarily hard to express properties such as “injectivity” or “surjectivity”.
$endgroup$
– amon
7 hours ago
3
$begingroup$
This seems like more of a CompSci question than Software Engineering. A better site for this question might be cs.stackexchange.com instead
$endgroup$
– Ben Cottrell
6 hours ago
2
$begingroup$
In modern maths, functions are pretty much literally nothing but a mapping from arguments to results. Which means, for example, that arrays, maps, and sets are also functions.
$endgroup$
– Jörg W Mittag
5 hours ago
add a comment |
$begingroup$
Here is a table of the Staten Island subway:
| STOP | STATION |
|------+-----------------|
| 1 | St. George |
| 2 | Tomkinsville |
| 3 | Stapleton |
| 4 | Clifton |
| 5 | Grasmere |
| 6 | Old Town |
| 7 | Dongan Hills |
| 8 | Jefferson |
| 9 | Grant |
| 10 | New Dorp |
| 11 | Oakwood Heights |
| 12 | Bay Terrace |
| 13 | Great Kills |
| 14 | Eltingville |
| 15 | Annadale |
| 16 | Hugenot |
| 17 | Prince’s Bay |
| 18 | Pleasant Plains |
| 19 | Richmond Valley |
| 20 | Arthur Kill |
| 21 | Tottenville |
and here is an Elisp function that maps a number to a name:
(defun sisubstops (s)
(pcase s
((pred (or (< s 1) (> s 21))) (message "Hey, just stops 1 through 21, please!"))
('1 (message "St. George"))
('2 (message "" Tomkinsville))
('3 (message "Stapleton"))
('4 (message " Clifton"))
('5 (message " Grasmere"))
('6 (message " Old Town"))
('7 (message " Dongan Hills"))
('8 (message " Jefferson"))
('9 (message " Grant"))
('10 (message " New Dorp"))
('11 (message " Oakwood Heights"))
('12 (message " Bay Terrace"))
('13 (message " Great Kills"))
('14 (message " Eltingville"))
('15 (message " Annadale"))
('16 (message " Hugenot"))
('17 (message " Prince’s Bay"))
('18 (message " Pleasant Plains"))
('19 (message " Richmond Valley"))
('20 (message " Arthur Kill"))
('21 (message " Tottenville"))))
So, when I'm trying to tell students that this is a function of a basically non-continuous phenomenon, i.e., we're not dealing with a function like f(x) = x^2
, rather a function that matches stops to names -- but it is still a function -- how can I get this across. One idea would be to got deep into Lambda Calculus and talk about how LC does conditionals. My first goal is to distinguish between continuous versus discrete; and yet I've written a Lisp function that can't really be represented as any sort of normal math function e.g., S(n) = M*n
where M
is some sort of machine or constant that takes a stop number and turns it into a stop name. Any ideas how, yes, this is a function? Or is this just a misnomer, i.e., comp-sci using/abusing the term function. So yes, how is sisubstops
really a function?
functional-programming mathematics
$endgroup$
Here is a table of the Staten Island subway:
| STOP | STATION |
|------+-----------------|
| 1 | St. George |
| 2 | Tomkinsville |
| 3 | Stapleton |
| 4 | Clifton |
| 5 | Grasmere |
| 6 | Old Town |
| 7 | Dongan Hills |
| 8 | Jefferson |
| 9 | Grant |
| 10 | New Dorp |
| 11 | Oakwood Heights |
| 12 | Bay Terrace |
| 13 | Great Kills |
| 14 | Eltingville |
| 15 | Annadale |
| 16 | Hugenot |
| 17 | Prince’s Bay |
| 18 | Pleasant Plains |
| 19 | Richmond Valley |
| 20 | Arthur Kill |
| 21 | Tottenville |
and here is an Elisp function that maps a number to a name:
(defun sisubstops (s)
(pcase s
((pred (or (< s 1) (> s 21))) (message "Hey, just stops 1 through 21, please!"))
('1 (message "St. George"))
('2 (message "" Tomkinsville))
('3 (message "Stapleton"))
('4 (message " Clifton"))
('5 (message " Grasmere"))
('6 (message " Old Town"))
('7 (message " Dongan Hills"))
('8 (message " Jefferson"))
('9 (message " Grant"))
('10 (message " New Dorp"))
('11 (message " Oakwood Heights"))
('12 (message " Bay Terrace"))
('13 (message " Great Kills"))
('14 (message " Eltingville"))
('15 (message " Annadale"))
('16 (message " Hugenot"))
('17 (message " Prince’s Bay"))
('18 (message " Pleasant Plains"))
('19 (message " Richmond Valley"))
('20 (message " Arthur Kill"))
('21 (message " Tottenville"))))
So, when I'm trying to tell students that this is a function of a basically non-continuous phenomenon, i.e., we're not dealing with a function like f(x) = x^2
, rather a function that matches stops to names -- but it is still a function -- how can I get this across. One idea would be to got deep into Lambda Calculus and talk about how LC does conditionals. My first goal is to distinguish between continuous versus discrete; and yet I've written a Lisp function that can't really be represented as any sort of normal math function e.g., S(n) = M*n
where M
is some sort of machine or constant that takes a stop number and turns it into a stop name. Any ideas how, yes, this is a function? Or is this just a misnomer, i.e., comp-sci using/abusing the term function. So yes, how is sisubstops
really a function?
functional-programming mathematics
functional-programming mathematics
edited 1 hour ago
heather
3,968836
3,968836
asked 7 hours ago
147pm147pm
1062
1062
migrated from softwareengineering.stackexchange.com 2 hours ago
This question came from our site for professionals, academics, and students working within the systems development life cycle.
migrated from softwareengineering.stackexchange.com 2 hours ago
This question came from our site for professionals, academics, and students working within the systems development life cycle.
2
$begingroup$
Huh, functions are routinely explained via tables, or via set theory where elements of the domain are mapped to elements in the codomain. Without the set theory explanation (which didactically works best with finite sets), it's unnecessarily hard to express properties such as “injectivity” or “surjectivity”.
$endgroup$
– amon
7 hours ago
3
$begingroup$
This seems like more of a CompSci question than Software Engineering. A better site for this question might be cs.stackexchange.com instead
$endgroup$
– Ben Cottrell
6 hours ago
2
$begingroup$
In modern maths, functions are pretty much literally nothing but a mapping from arguments to results. Which means, for example, that arrays, maps, and sets are also functions.
$endgroup$
– Jörg W Mittag
5 hours ago
add a comment |
2
$begingroup$
Huh, functions are routinely explained via tables, or via set theory where elements of the domain are mapped to elements in the codomain. Without the set theory explanation (which didactically works best with finite sets), it's unnecessarily hard to express properties such as “injectivity” or “surjectivity”.
$endgroup$
– amon
7 hours ago
3
$begingroup$
This seems like more of a CompSci question than Software Engineering. A better site for this question might be cs.stackexchange.com instead
$endgroup$
– Ben Cottrell
6 hours ago
2
$begingroup$
In modern maths, functions are pretty much literally nothing but a mapping from arguments to results. Which means, for example, that arrays, maps, and sets are also functions.
$endgroup$
– Jörg W Mittag
5 hours ago
2
2
$begingroup$
Huh, functions are routinely explained via tables, or via set theory where elements of the domain are mapped to elements in the codomain. Without the set theory explanation (which didactically works best with finite sets), it's unnecessarily hard to express properties such as “injectivity” or “surjectivity”.
$endgroup$
– amon
7 hours ago
$begingroup$
Huh, functions are routinely explained via tables, or via set theory where elements of the domain are mapped to elements in the codomain. Without the set theory explanation (which didactically works best with finite sets), it's unnecessarily hard to express properties such as “injectivity” or “surjectivity”.
$endgroup$
– amon
7 hours ago
3
3
$begingroup$
This seems like more of a CompSci question than Software Engineering. A better site for this question might be cs.stackexchange.com instead
$endgroup$
– Ben Cottrell
6 hours ago
$begingroup$
This seems like more of a CompSci question than Software Engineering. A better site for this question might be cs.stackexchange.com instead
$endgroup$
– Ben Cottrell
6 hours ago
2
2
$begingroup$
In modern maths, functions are pretty much literally nothing but a mapping from arguments to results. Which means, for example, that arrays, maps, and sets are also functions.
$endgroup$
– Jörg W Mittag
5 hours ago
$begingroup$
In modern maths, functions are pretty much literally nothing but a mapping from arguments to results. Which means, for example, that arrays, maps, and sets are also functions.
$endgroup$
– Jörg W Mittag
5 hours ago
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
In math, a function is just an association between each element in a set X and a specific element in set Y. X and Y can be any well defined set: real numbers, rational numbers, integers, even integers, odd integers, all the real numbers except 0, words, names of states, names of cities, etc. Calling a table mapping between between bus stop numbers and bus stop names a function is perfectly sound mathematically as long as no single stop maps to two different names.
$endgroup$
add a comment |
$begingroup$
Focus on the idea that the sets can be finite. They don't need to be defined by a formula. Any set of ordered pairs is a relation. If there is a unique second element for any given first element then it is a function.
You don't need Lambda Calculus or any mathematics to show what a function is. Finite functions can be computed by table lookup or by hash maps.
Actually functions defined by formulas in computing are often problematic since computations of many values (say Real Values) are only approximate.
$endgroup$
add a comment |
$begingroup$
Talk about step functions. This might get the point across that functions do not need to be continuous. (I think going into lambda calculus would just confuse your students here - there's no need.)
As for whether this is really a function - sure it is! To make it clearer, here's something you can do. The written numbers we have - '7', for instance - just stand in for the concept of seven. We could really use the symbol 'a' to stand in for the concept of seven. (Just as we can use any variable name to hold the value inside - though we do tend to choose variable names that 'make sense' to us.)
With that in mind, what keeps us from saying that 'St. George' is just another symbol? Nothing. The symbols don't matter, the relation between them does - that's what makes a function a function.
$endgroup$
add a comment |
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "678"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcseducators.stackexchange.com%2fquestions%2f5619%2fdiscrete-function-is-also-a-math-function%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
In math, a function is just an association between each element in a set X and a specific element in set Y. X and Y can be any well defined set: real numbers, rational numbers, integers, even integers, odd integers, all the real numbers except 0, words, names of states, names of cities, etc. Calling a table mapping between between bus stop numbers and bus stop names a function is perfectly sound mathematically as long as no single stop maps to two different names.
$endgroup$
add a comment |
$begingroup$
In math, a function is just an association between each element in a set X and a specific element in set Y. X and Y can be any well defined set: real numbers, rational numbers, integers, even integers, odd integers, all the real numbers except 0, words, names of states, names of cities, etc. Calling a table mapping between between bus stop numbers and bus stop names a function is perfectly sound mathematically as long as no single stop maps to two different names.
$endgroup$
add a comment |
$begingroup$
In math, a function is just an association between each element in a set X and a specific element in set Y. X and Y can be any well defined set: real numbers, rational numbers, integers, even integers, odd integers, all the real numbers except 0, words, names of states, names of cities, etc. Calling a table mapping between between bus stop numbers and bus stop names a function is perfectly sound mathematically as long as no single stop maps to two different names.
$endgroup$
In math, a function is just an association between each element in a set X and a specific element in set Y. X and Y can be any well defined set: real numbers, rational numbers, integers, even integers, odd integers, all the real numbers except 0, words, names of states, names of cities, etc. Calling a table mapping between between bus stop numbers and bus stop names a function is perfectly sound mathematically as long as no single stop maps to two different names.
answered 4 hours ago
Charles E. Grant
add a comment |
add a comment |
$begingroup$
Focus on the idea that the sets can be finite. They don't need to be defined by a formula. Any set of ordered pairs is a relation. If there is a unique second element for any given first element then it is a function.
You don't need Lambda Calculus or any mathematics to show what a function is. Finite functions can be computed by table lookup or by hash maps.
Actually functions defined by formulas in computing are often problematic since computations of many values (say Real Values) are only approximate.
$endgroup$
add a comment |
$begingroup$
Focus on the idea that the sets can be finite. They don't need to be defined by a formula. Any set of ordered pairs is a relation. If there is a unique second element for any given first element then it is a function.
You don't need Lambda Calculus or any mathematics to show what a function is. Finite functions can be computed by table lookup or by hash maps.
Actually functions defined by formulas in computing are often problematic since computations of many values (say Real Values) are only approximate.
$endgroup$
add a comment |
$begingroup$
Focus on the idea that the sets can be finite. They don't need to be defined by a formula. Any set of ordered pairs is a relation. If there is a unique second element for any given first element then it is a function.
You don't need Lambda Calculus or any mathematics to show what a function is. Finite functions can be computed by table lookup or by hash maps.
Actually functions defined by formulas in computing are often problematic since computations of many values (say Real Values) are only approximate.
$endgroup$
Focus on the idea that the sets can be finite. They don't need to be defined by a formula. Any set of ordered pairs is a relation. If there is a unique second element for any given first element then it is a function.
You don't need Lambda Calculus or any mathematics to show what a function is. Finite functions can be computed by table lookup or by hash maps.
Actually functions defined by formulas in computing are often problematic since computations of many values (say Real Values) are only approximate.
answered 2 hours ago
BuffyBuffy
23.9k94185
23.9k94185
add a comment |
add a comment |
$begingroup$
Talk about step functions. This might get the point across that functions do not need to be continuous. (I think going into lambda calculus would just confuse your students here - there's no need.)
As for whether this is really a function - sure it is! To make it clearer, here's something you can do. The written numbers we have - '7', for instance - just stand in for the concept of seven. We could really use the symbol 'a' to stand in for the concept of seven. (Just as we can use any variable name to hold the value inside - though we do tend to choose variable names that 'make sense' to us.)
With that in mind, what keeps us from saying that 'St. George' is just another symbol? Nothing. The symbols don't matter, the relation between them does - that's what makes a function a function.
$endgroup$
add a comment |
$begingroup$
Talk about step functions. This might get the point across that functions do not need to be continuous. (I think going into lambda calculus would just confuse your students here - there's no need.)
As for whether this is really a function - sure it is! To make it clearer, here's something you can do. The written numbers we have - '7', for instance - just stand in for the concept of seven. We could really use the symbol 'a' to stand in for the concept of seven. (Just as we can use any variable name to hold the value inside - though we do tend to choose variable names that 'make sense' to us.)
With that in mind, what keeps us from saying that 'St. George' is just another symbol? Nothing. The symbols don't matter, the relation between them does - that's what makes a function a function.
$endgroup$
add a comment |
$begingroup$
Talk about step functions. This might get the point across that functions do not need to be continuous. (I think going into lambda calculus would just confuse your students here - there's no need.)
As for whether this is really a function - sure it is! To make it clearer, here's something you can do. The written numbers we have - '7', for instance - just stand in for the concept of seven. We could really use the symbol 'a' to stand in for the concept of seven. (Just as we can use any variable name to hold the value inside - though we do tend to choose variable names that 'make sense' to us.)
With that in mind, what keeps us from saying that 'St. George' is just another symbol? Nothing. The symbols don't matter, the relation between them does - that's what makes a function a function.
$endgroup$
Talk about step functions. This might get the point across that functions do not need to be continuous. (I think going into lambda calculus would just confuse your students here - there's no need.)
As for whether this is really a function - sure it is! To make it clearer, here's something you can do. The written numbers we have - '7', for instance - just stand in for the concept of seven. We could really use the symbol 'a' to stand in for the concept of seven. (Just as we can use any variable name to hold the value inside - though we do tend to choose variable names that 'make sense' to us.)
With that in mind, what keeps us from saying that 'St. George' is just another symbol? Nothing. The symbols don't matter, the relation between them does - that's what makes a function a function.
answered 1 hour ago
heatherheather
3,968836
3,968836
add a comment |
add a comment |
Thanks for contributing an answer to Computer Science Educators Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcseducators.stackexchange.com%2fquestions%2f5619%2fdiscrete-function-is-also-a-math-function%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
2
$begingroup$
Huh, functions are routinely explained via tables, or via set theory where elements of the domain are mapped to elements in the codomain. Without the set theory explanation (which didactically works best with finite sets), it's unnecessarily hard to express properties such as “injectivity” or “surjectivity”.
$endgroup$
– amon
7 hours ago
3
$begingroup$
This seems like more of a CompSci question than Software Engineering. A better site for this question might be cs.stackexchange.com instead
$endgroup$
– Ben Cottrell
6 hours ago
2
$begingroup$
In modern maths, functions are pretty much literally nothing but a mapping from arguments to results. Which means, for example, that arrays, maps, and sets are also functions.
$endgroup$
– Jörg W Mittag
5 hours ago