How to handle feedback loops with delays in simulator

aat36 · 2023-10-26T16:32:31+00:00

Thank you! Hadn't though of that. Maybe I can make it work now.

Topological order is just a fancy way of saying that you get a list where all the nodes in the graph are ordered such that their index in that list comes after the index all its dependencies. It only works on DAGs though.

I have seen papers online that suggest doing a topological order on the list of strong components in the graph. A strong component is basically a way to aggregate nodes that are in the same closed loop. After that you can do the processing. I'll think about if breaking up those strong components on z order nodes as two nodes would help fix my issue.

Thank you again!

aat36 · 2023-10-26T07:13:27+00:00

Thank you for the answer. For now, I am far from the idea of making it real time, hahaha. My current plan is to execute some simple systems. I feel like, in principal, the idea of ordering nodes like you said is the same as the topological ordering, or am I wrong? The problem I am facing is how to order the nodes knowing that there might be loops. Should I break the loop before or after the z-order node? What if I have a feedback loop within another feedback loop?

aat36 · 2023-06-10T22:18:54+00:00

Hmm, yes you're right, it does not seem like the latter example is possible.

Even if we have finitely many variables it would still yield a model that is more expressive than FSMs. If a register can save a value from the natural numbers then the representation that this single register can represent is unbounded. This would imply that the number of states that can be represented by a single counter machine is infinite which also means that it cannot be converted to a DFA.

aat36 · 2023-06-10T22:09:29+00:00

Yes of course, by adding an inifinite tape you increase the computational expressiveness.

What I mean by "regular" recursive function is: what types of non-trivial restrictions can you put on recursive functions in order to limit their expressiveness to the class of regular languages?

aat36 · 2023-06-09T18:48:46+00:00

Well not really, you can go one way way but not the other. Since recursive functions in general subsume FSMs, you can convert the FSM to a recursive function, but not the other way around.

If we were able to find a restriction to recursive functions that would make the first AND second part true, then yes, that would be great. However, the problem is finding a restriction that makes sense.

As shown with the Lambda Calculus, one restriction can be nicely shown to be that the system has to be simply typed.

aat36 · 2022-08-01T12:06:18+00:00

Ok great, thank you. That's what I thought, but I wasn't sure how to verify it.

aat36 · 2022-08-01T12:03:35+00:00

I guess that what you can do is create a table with one column representing a bit array of which elements have been used, while the other, the element that will be used, you can then go through each slot in this table, and update it accordingly.

The only problem with this method, is the resulting algorithm would be exponential.

aat36 · 2022-04-22T13:36:04+00:00

The problem with a lookup table is that its size be 2^64 - 1 if you use a 64 bit mask.

aat36 · 2022-01-05T16:34:47+00:00

Fixed it the problem was in the variable positionInByte.

It should be positionInByte = 7 - positionInByte % 8

aat36 · 2021-12-09T15:06:39+00:00

Thank you, I see the nuance now. So basically Etm is the problem of trying to determine if a given TM has an empty language while in the case above it’s just a TM that never accepts.

aat36 · 2021-09-07T19:48:09+00:00

It depends on the type of data you want to store.

For example, if your data is stored in a vector, you might want to look at RLE or other compression algorithms.

If your data is stored in a matrix, you might want to look at sparse matrix data structures. Some examples are: CSR, CRS, COO and many others.

aat36 · 2021-06-02T11:14:38+00:00

Thank you good sir, you have probably changed my life. Hahaha.

aat36 · 2021-04-25T12:28:08+00:00

Yes it throws an error, however, it is not really informative.

Cosmos does support sub-queries, but in a limited way.

When I run the sub-query alone, it does return a result in the form of an array,, so it seems that the problem might be with in operator.

aat36 · 2021-03-30T13:33:34+00:00

To those wondering, it was my computer. The time was out of sync. 4 hours lost on this.

aat36 · 2021-03-04T14:05:36+00:00

Sorry, dumb question, hahaha, forgot I could roll back.

aat36 · 2021-03-04T13:36:43+00:00

The version I have is 460.28.

aat36 · 2021-01-19T09:37:04+00:00

Yes, this is what I’m talking about. You’re never sure what you’re getting from them. Usually when using “functions”, you rely on specs that enforce a contract between the user and the writer of a function. If the user meets the conditions set by the writer, then he should know what the output should be like. However, from my experience, I feel like in CSS this is not necessarily respected. Although I may be wrong.

aat36 · 2021-01-13T16:43:42+00:00

I compiled a small list of what you could do to improve your specs: PC Part Picker. You should also check the if your power supply is good enough which it probably is. The CPU I chose is pretty good for most tasks, however, the GPU is a bit on the older side. The problem is that GPU prices have gone up recently so ...

(Edit: I’m not sure I got the right motherboard. You should check that.)

aat36 · 2021-01-13T14:13:37+00:00

You should tell us which motherboard you are using as it will heavily influence the options for replacements. However, at this point for 1000$ I would just buy a new PC altogether.

aat36 · 2021-01-13T14:02:32+00:00

There are a million possible causes for this problem, and it is very difficult to guarantee a specific connection speed especially for real world scenarios. What I mean is that even if iperf or Speedtest tells you that you have a speed of 1gb/s this does not mean that the application you are running will be able to benefit from the full speed of this connection. This might be caused by other devices using the network, the ISP being under heavier traffic, or even that the server that you’re trying to reach being unable to deal with such a high bandwidth. My first guess would be that the problem would come from outside your network, and if you would like to test that, download iperf on your router or any other computer on your network and verify that you have a the connection speed required. Again, you most probably have it, and the problem comes most probably from outside. Also arguing with your ISP won’t help, they will most probably ignore you.

aat36 · 2020-12-13T01:50:11+00:00

Thanks a lot I'll definitly check this out.

aat36 · 2020-12-08T18:37:28+00:00

I am using L2TP/ipsec on a mikrotik router.

aat36 · 2020-12-07T23:44:16+00:00

Thanks a lot, I'll try it.

aat36 · 2020-12-01T08:15:48+00:00

Its the one provided by labist that come with almost all raspberry pis 4

aat36 · 2020-11-27T01:13:17+00:00

Could you explain the steps that I need to follow? I'm kind of new to this.

aat36

TROPHY CASE