Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Research solving / simplifying system of co-recursive symbolic equations #13

Open
KinanBab opened this issue Mar 12, 2020 · 0 comments
Open

Research solving / simplifying system of co-recursive symbolic equations #13

KinanBab opened this issue Mar 12, 2020 · 0 comments
Assignees
@p-flock @KinanBab @Ra1issa @wyatt-howe
Milestone
Future

Comments

@KinanBab
Copy link
Member

Attempt to find a reasonable closed form that is "nice looking"

Cases to consider:

  1. No recursion: reduces to inline and simplify
  2. Single function recursion: inline, simplify, solve recurrence
  3. Co-recursive functions: ?

Solving recurrences:

  1. Masters or Akra/Bazzi theorem: asymptotic
  2. Outsource to wolfram or other algerbra systems
  3. Pattern / rule based
  4. Heurstic driven search?

Prove that closed form is correct solution, important for 3 and 4 (maybe 2?):

  1. Induction (in style of sums)
  2. SMT?
@KinanBab KinanBab added this to the Future milestone Mar 12, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@p-flock p-flock

@KinanBab KinanBab

@Ra1issa Ra1issa

@wyatt-howe wyatt-howe

Labels
None yet
Projects
None yet
Milestone
Future
Development

No branches or pull requests
4 participants
@p-flock @KinanBab @Ra1issa @wyatt-howe