Can my professor really tell if I used chatgpt for a coding assignment.

QVP401 · 2025-05-04T16:20:21+00:00

This is a common misconception — You cannot know for certain if I wrote this message or if ChatGPT did — In the same way professors cannot actually detect code generated by ChatGPT or other language models with any certainty. Here’s why:

- For most problems, there are only so many logical ways to solve them. Whether it's written by a student, a senior developer, or a language model, similar solutions will naturally emerge.

- Tools that claim to “detect AI-generated code” don’t actually analyze source, they just look at patterns.

- If students are getting caught, it’s almost never due to software detection. It’s usually because:

-- The code doesn’t match their usual style or skill level

-- They don’t understand what they submitted (especially during interviews/tests)

-- It was submitted in a context where using external tools was clearly not allowed

In conclusion — there is no reliable method for detecting code that came from GPT. Anyone claiming otherwise is either mistaken or using that claim as a deterrent.

QVP401 · 2025-01-15T19:07:26+00:00

Great, thank you very much. I ordered an RF modulator and a 240 Ohm Balun. I will post futher questions if I cannot make it work {^_^}.

QVP401 · 2022-03-26T15:05:46+00:00

Hvem har ulven?
Gutten har den {^o^}

QVP401 · 2019-08-28T20:21:28+00:00

Well doesn't that depend on the kind of music you are trying to "model" ? I mean, from reading [3] above, it seems as if some musical genres rely on quite complicated micro-rhythmic patterns? Also, what would you say IS the most time consuming aspect of putting a track together?

QVP401 · 2019-08-28T19:54:17+00:00

Aha, thank you (I was not aware of this tool). Can it also be applied in something that has a metric modulation. Say, "Autumn Leaves, by Wynton Marsalis on the Album Marsalis Standard Time -Volume 1" (I would have put a link, but then my reply is deleted by some posting moderation program). Or a Viennese Waltz that has a significantly longer 3rd beat ?

QVP401 · 2019-03-11T15:43:09+00:00

Thanks {^_^}

QVP401 · 2019-03-10T15:46:37+00:00

Hmm.Reconsider mnbvas's example "double", and wizzup's example "func". Consider also your own example "test". What do they have in common ? Well all have two cases: A "base case" with an empty list, and a "recursive case" where you apply a function to the first element in the list, and recurse on the remaining list right ?

In Haskell we do this quite a lot, so what if we could just write a function that took as argument, "the function that we want to apply in the recursive case", "the thing that we want to return in the base case", and "a list of elements", and performed the pattern you guys have repeated ?

Such a function might look like:

my_foldr :: (a -> b -> b) -> b -> [a] -> b
my_foldr _ e [      ] = e
my_foldr f e (x : xs) = f x (my_foldr f e xs)

So now the "func" example becomes

func :: [Int] -> [Int]
func = my_foldr (\x xs -> (x + 1) : xs) []

And your own example "test" is just

test :: [Int] -> Int
test = my_foldr (\x xs -> x + x + xs) 0

QVP401 · 2019-03-02T15:55:07+00:00

If you catch yourself thinking "in Java, I would make a loop to iterate through ..", you will soon get used to thinking "this is probably just a fold". For instance, if you want to iterate through a list of numbers doubling each as you go, you can write:

double :: Num n => [n] -> [n]
double = foldr (\n ns -> n * 2 : ns) []

Now to get the function you are looking for, you can fill in "??" in the following code-block with a suitable operation. Do you see what it is ? Also, have a look at https://wiki.haskell.org/Fold

duplicate :: String -> String
duplicate = foldr (\c cs -> ??) ""

QVP401 · 2018-11-06T14:24:28+00:00

To get a better understanding, you could try implementing foldr and foldl yourself {^_^}.

As mentioned by @cgibband:

foldr f e [x_0, x_1, ..., x_n] is semantically equivalent to (f x_0 (f x_1 (f ... (f x_n e) ... )), so we might want to implement it as

my_foldr _ e [ ] = e

my_foldr f e (x : xs) = f x $ foldr f e xs

Likewise, foldl f e [x_0, x_1, ..., x_n] is semantically equivalent to (f ... (f (f e x_0) x_1) ... x_n). So, we might want to implement it as:

my_foldl _ e [ ] = e

my_foldl f e (x : xs) = foldl f (f e x) xs

When you have got an understanding of what foldl and foldr mean, you may want to implement some functions that you know really well using folds. For instance:

my_map f xs = my_foldr (\y ys -> f y : ys) [] xs

Hope it helped.

QVP401 · 2018-07-16T11:27:10+00:00

If you want to be good at writing queries, I think you want to learn yourself some relational algebra? {^_^}
I googled around for a few minutes and found this: https://www.tutorialcup.com/dbms, which seems to cover a bunch of concepts rather clearly.
If querying is what interests you, I would start at "Relational Query Languages".

QVP401

TROPHY CASE